The chromaticity of wheels with a missing spoke

DOI10.1016/0012-365X(90)90326-DzbMath0712.05025OpenAlexW2112338391WikidataQ127847438 ScholiaQ127847438MaRDI QIDQ923093

Gek Ling Chia

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90326-d

zbMATH Keywords

chromatic polynomialchromatically unique graphsproper vertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

On graphs in which any pair of colour classes but one induces a tree ⋮ On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\) ⋮ The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ The chromaticity of wheels with a missing spoke. II ⋮ On the structure and chromaticity of graphs in which any two colour classes induce a tree ⋮ On the chromatic uniqueness of the graph \(W(n,n-2,k)\) ⋮ On the chromatic uniqueness of certain bipartite graphs ⋮ Classes of chromatically unique graphs ⋮ All wheels with two missing consecutive spokes are chromatically unique ⋮ Classes of chromatically unique or equivalent graphs ⋮ The search for chromatically unique graphs ⋮ The chromaticity of certain graphs with five triangles

Cites Work

• The chromaticity of wheels
• A note on the chromatic uniqueness of \(W_ 10\)
• On chromatic coefficients
• Chromatically unique graphs
• Parallel concepts in graph theory
• Cutpoints and the chromatic polynomial
• On chromatic equivalence of graphs
• An introduction to chromatic polynomials

This page was built for publication: The chromaticity of wheels with a missing spoke