Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices

DOI10.1007/s11766-004-0029-6zbMath1045.05048OpenAlexW1991007392MaRDI QIDQ1430648

Sheng Gui Zhang, Ru-Ying Liu, Hai-xing Zhao

Publication date: 27 May 2004

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-004-0029-6

zbMATH Keywords

chromaticitychromatically equivalentchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On chromatic uniqueness of certain 5-partite graphs ⋮ Chromaticity of complete 6-partite graphs with certain star or matching deleted. II

Cites Work

• Unnamed Item
• The search for chromatically unique graphs
• The search for chromatically unique graphs. II
• Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
• Expansions of Chromatic Polynomials and Log-Concavity

This page was built for publication: Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices