Chromatic equivalence classes of complete tripartite graphs

DOI10.1016/j.disc.2007.12.059zbMath1213.05072OpenAlexW2067089617MaRDI QIDQ5901354

Chee-Kit Ho, Gek Ling Chia

Publication date: 28 January 2009

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

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

zbMATH Keywords

chromatic uniquenesschromatic polynomialscomplete tripartite graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The chromatic equivalence class of \(K_{1, n, n + 2}\)

Cites Work

• The search for chromatically unique graphs
• On chromatic coefficients
• Chromatic polynomials for regular graphs and modified wheels
• On maximally saturated graphs
• A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs
• The chromaticity of complete bipartite graphs with at most one edge deleted
• Chromaticity of two-trees
• An introduction to chromatic polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic equivalence classes of complete tripartite graphs