Two classes of chromatically unique graphs

DOI10.1016/0012-365X(90)90041-FzbMath0697.05027OpenAlexW2018504413MaRDI QIDQ911611

B. H. Goh, Khee Meng Koh

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)90041-f

zbMATH Keywords

chromatic polynomialchromatically unique graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Some problems on chromatic polynomials ⋮ A bibliography on chromatic polynomials ⋮ The chromaticity of complete bipartite graphs with at most one edge deleted ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ On the chromatic uniqueness of certain bipartite graphs ⋮ Classes of chromatically unique graphs ⋮ Classes of chromatically unique or equivalent graphs ⋮ The search for chromatically unique graphs ⋮ Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromaticity of wheels
• On the chromatic uniqueness of bipartite graphs
• On chromatic coefficients
• On maximally saturated graphs
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Chromatically unique graphs
• Chromatic uniqueness and equivalence ofK4 homeomorphs
• Cutpoints and the chromatic polynomial
• On chromatic equivalence of graphs
• Chromatic polynomials and whitney's broken circuits
• A note on chromatic uniqueness of graphs
• An introduction to chromatic polynomials
• Chromatic Polynomials

This page was built for publication: Two classes of chromatically unique graphs