40 citations · 96 across the 32 of their papers we have counts for
37 papers
Extensions of Courcelle's Theorem without Logic
Yuval Filmus, Johann A. Makowsky
Courcelle's Theorem states that on graphs of tree-width at most with a given tree-decomposition of size , graph properties definable in Monadic Second O…
Distinctive power and comparability of Harary polynomial
Johann A. Makowsky
Let be a graph property. A -coloring with at most colors is a coloring of the vertices of a simple graph such that each color class induces a gra…
Courcelle's Theorem Without Logic
Yuval Filmus, Johann A. Makowsky
Courcelle's Theorem states that on graphs of tree-width at most with a given tree-decomposition of size , graph properties definable in Monadic Second O…
Effective MC-finiteness
Yuval Filmus, Eldar Fischer, Johann A. Makowsky
An integer sequence is \emph{MC-finite} if for all , the sequence is eventually periodic. There are MC-finite sequences $(a_n)_{n \in \m…
Meta-theorems for Graph Polynomials
Johann A. Makowsky
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e.,…
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…