On chromatic uniqueness of certain 5-partite graphs

DOI10.1007/s12190-009-0374-yzbMath1238.05100OpenAlexW2052962382MaRDI QIDQ2430496

Yee-Hock Peng, Ameen Shaman Ameen, Hasni Roslan, Hai-xing Zhao

Publication date: 6 April 2011

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-009-0374-y

zbMATH Keywords

chromatic polynomialchromatically equivalent graphs

Mathematics Subject Classification ID

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

Cites Work

• The search for chromatically unique graphs
• The search for chromatically unique graphs. II
• Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices
• Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
• Expansions of Chromatic Polynomials and Log-Concavity
• Chromaticity of complete 4-partite graphs with certain star or matching deleted
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On chromatic uniqueness of certain 5-partite graphs