Harary polynomials

12 Jul 2020 Herscovici Orli Makowsky Johann A. Rakita Vsevolod

Given a graph property $\mathcal{P}$, F. Harary introduced in 1985 $\mathcal{P}$-colorings, graph colorings where each colorclass induces a graph in $\mathcal{P}$. Let $\chi_{\mathcal{P}}(G;k)$ counts the number of $\mathcal{P}$-colorings of $G$ with at most $k$ colors... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS