Showing math.COShow all
3 papers · 1 filter
math.CO2025
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…
math.CO2025
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…
math.CO2024
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.,…