2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2023
How I got to like graph polynomials
Johann A. Makowsky
For Boris Zilber on his 75th birthday. I trace the roots of my collaboration with Boris Zilber, which combines categoricity theory, finite model theory, algorithmics, and combinato…
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…
math.CO2014★ 2 cited
Finiteness conditions for graph algebras over tropical semirings
Nadia Labai, Johann A. Makowsky
Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lov{á}sz and A. Schrijver (2007). Graph parameters with connection matrices…