The chromaticity of wheels with a missing spoke

DOI10.1016/0012-365X(90)90326-DMaRDI QIDQ923093zbMATH OpenOpenAlexWikidataFDO

Authors Gek L. 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)

Recommendations

• The chromaticity of wheels with a missing spoke. II
• scientific article; zbMATH DE number 742643
• The chromaticity of wheels
• scientific article; zbMATH DE number 1040592
• The chromaticity of certain graphs with five triangles

Cites work

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

Cited in

(20)

• Classes of chromatically unique graphs
• The chromaticity of wheels with a missing spoke. II
• The chromatic uniqueness of \(W_{10}\)
• A bibliography on chromatic polynomials
• The chromatic uniqueness of certain broken wheels
• On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)
• On the chromatic uniqueness of the graph \(W(n,n-2,k)\)
• On the metric basis in wheels with consecutive missing spokes
• scientific article; zbMATH DE number 2094583 (Why is no real title available?)
• The chromaticity of certain graphs with five triangles
• On graphs in which any pair of colour classes but one induces a tree
• On the structure and chromaticity of graphs in which any two colour classes induce a tree
• On Tutte polynomial uniqueness of twisted wheels
• Classes of chromatically unique or equivalent graphs
• The search for chromatically unique graphs
• On the join of graphs and chromatic uniqueness
• The chromaticity of wheels
• The search for chromatically unique graphs. II
• On the chromatic uniqueness of certain bipartite graphs
• All wheels with two missing consecutive spokes are chromatically unique

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

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