A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs

DOI10.1016/j.disc.2004.07.014zbMath1061.05034OpenAlexW2081692891WikidataQ123188759 ScholiaQ123188759MaRDI QIDQ1763351

Chengfu Ye, Hai-xing Zhao, Ru-Ying Liu

Publication date: 22 February 2005

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

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

zbMATH Keywords

chromatic polynomialchromatic uniquenesscomplete tripartite graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Chromatic equivalence classes of complete tripartite graphs ⋮ About chromatic uniqueness of some complete tripartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• On maximally saturated graphs
• The search for chromatically unique graphs. II
• The chromatic uniqueness of certain complete \(t\)-partite graphs.
• Expansions of Chromatic Polynomials and Log-Concavity

This page was built for publication: A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs