The chromaticity of wheels

DOI10.1016/0012-365X(84)90072-4zbMath0547.05032OpenAlexW1995702405MaRDI QIDQ798668

Xhaoji Xu, Nian-Zu Li

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90072-4

zbMATH Keywords

chromatic polynomialchromatically unique graphswheel

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Classes of chromatically equivalent graphs and polygon trees ⋮ A note on the chromatic uniqueness of \(W_ 10\) ⋮ On graphs in which any pair of colour classes but one induces a tree ⋮ A bibliography on chromatic polynomials ⋮ Chromatic polynomials of generalized trees ⋮ On the structure and chromaticity of graphs in which any two colour classes induce a tree ⋮ Two classes of chromatically unique graphs ⋮ The chromaticity of wheels with a missing spoke ⋮ Pairs of chromatically equivalent graphs ⋮ The chromatic uniqueness of \(W_{10}\) ⋮ The search for chromatically unique graphs ⋮ The chromaticity of certain graphs with five triangles ⋮ Chromaticity of two-trees

Cites Work

• Chromatically unique graphs
• Parallel concepts in graph theory
• On chromatic equivalence of graphs
• An introduction to chromatic polynomials
• On chromatic polynomials and the golden ratio

This page was built for publication: The chromaticity of wheels