40 citations · 48 across the 6 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 4 cited
On P-unique hypergraphs
J. A. Makowsky, R. X. Zhang
We study hypergraphs which are uniquely determined by their chromatic, independence and matching polynomials. B. Bollobás, L. Pebody and O. Riordan (2000) conjectured (BPR-conjectu…
math.CO2017★ 1 cited
On sequences of polynomials arising from graph invariants
T. Kotek, J. A. Makowsky, E. V. Ravve
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebrai…