Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)

DOI10.1016/S0012-365X(02)00592-7zbMath1008.05061OpenAlexW176333607MaRDI QIDQ1861236

Chengfu Ye, Nian-Zu Li

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00592-7

zbMATH Keywords

chromatic polynomialadjoint polynomial

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\) ⋮ On problems and conjectures on adjointly equivalent graphs

This page was built for publication: Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)