The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)

DOI10.1016/j.disc.2006.10.020zbMath1161.05034OpenAlexW1987520239MaRDI QIDQ952643

Haizhen Ren, Haicheng Ma

Publication date: 12 November 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.10.020

zbMATH Keywords

chromatic polynomialchromatically equivalentadjoint polynomialchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the Roots of σ-Polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The partition polynomial of a finite set system
• Chromaticity of the complements of paths and cycles
• A new method for proving chromatic uniqueness of graphs
• Adjoint polynomials and chromatically unique graphs
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• Chromaticity of some families of dense graphs
• Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
• \(\sigma\)-polynomials and graph coloring

This page was built for publication: The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)