1 citations · 3 across the 5 of their papers we have counts for
5 papers
MC-finiteness of restricted set partition functions
Yuval Filmus, Eldar Fischer, Johann A. Makowsky +1
A sequence of integers is MC-finite if for every the sequence is ultimately periodic. We discuss various ways of proving and di…
Almost Unimodal and Real-Rooted Graph Polynomials
Johann A. Makowsky, Vsevolod Rakita
It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials have been stud…
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 Weakly Distinguishing Graph Polynomials
Johann A. Makowsky, Vsevolod Rakita
A univariate graph polynomial P(G;X) is weakly distinguishing if for almost all finite graphs G there is a finite graph H with P(G;X)=P(H;X). We show that the clique polynomial and…