12 citations · 34 across the 17 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
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…
math.LO2017★ 2 cited
A logician's view of graph polynomials
J. A. Makowsky, E. V. Ravve, T. Kotek
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polyno…
math.CO2017★ 1 cited
On the complexity of generalized chromatic polynomials
A. Goodall, M. Hermann, T. Kotek +2
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for h…