40 citations · 48 across the 6 of their papers we have counts for
4 papers · 1 filter
Harary polynomials
Orli Herscovici, Johann A. Makowsky, Vsevolod Rakita
Given a graph property , F. Harary introduced in 1985 -colorings, graph colorings where each colorclass induces a graph in . Let $χ_{\mathcal…
Weakly Distinguishing Graph Polynomials on Addable Properties
Johann A. Makowsky, Vsevolod Rakita
A graph polynomial is weakly distinguishing if for almost all finite graphs there is a finite graph that is not isomorphic to with . It is weakly disting…
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…
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…