Chromaticity of some families of dense graphs

DOI10.1016/S0012-365X(02)00355-2zbMath1010.05024MaRDI QIDQ1850066

Michael D. Hendy, Kee L. Teo, Charles H. C. Little, Fengming Dong

Publication date: 2 December 2002

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

zbMATH Keywords

chromatic polynomialchromatically equivalentadjoint polynomialchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\) ⋮ 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 ⋮ On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs

This page was built for publication: Chromaticity of some families of dense graphs