On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)

DOI10.1016/0012-365X(94)00056-OzbMath0837.05055MaRDI QIDQ1901034

Yanpei Liu, Fengming Dong

Publication date: 23 April 1996

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

zbMATH Keywords

chromatic polynomialwheelchromatic uniquenesschromatically equivalentchromatically unique

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials

Cites Work

• The search for chromatically unique graphs
• The chromaticity of wheels with a missing spoke
• Chromaticity of two-trees
• Onq-trees

This page was built for publication: On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)