Chromaticity of the complements of some sparse graphs

MaRDI QIDQ5294908zbMATH OpenFDO

Authors Haixing Zhao, Xueliang Li, Ru Ying Liu

Publication date 26 July 2007

zbMATH Keywords

chromatic polynomialchromatic uniqueness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromaticity of some families of dense graphs
• Two classes of chromatically unique graphs
• scientific article; zbMATH DE number 1094005
• scientific article; zbMATH DE number 6260058
• scientific article; zbMATH DE number 1264051

Cited in

(5)

• The chromatic polynomial between graph \& its complement---about Akiyama and Harary's open problem
• Chromaticity of the complements of D_n
• scientific article; zbMATH DE number 1094005 (Why is no real title available?)
• scientific article; zbMATH DE number 1563918 (Why is no real title available?)
• A Combinatorial Classic — Sparse Graphs with High Chromatic Number

This page was built for publication: Chromaticity of the complements of some sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294908)