The chromatic uniqueness of certain complete \(t\)-partite graphs.

DOI10.1016/j.disc.2003.06.014zbMath1036.05024OpenAlexW2033759548MaRDI QIDQ1420623

Hui Wen Zou

Publication date: 2 February 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.06.014

zbMATH Keywords

chromatic polynomialchromatically unique graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs, On Garlands in \(\chi\)-uniquely colorable graphs, Note on chromatic polynomials of the threshold graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• On maximally saturated graphs
• The search for chromatically unique graphs. II
• The chromaticity of complete bipartite graphs with at most one edge deleted
• On chromatic equivalence of graphs
• A new 5‐arc‐transitive cubic graph