Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

DOI10.1002/jgt.1003zbMath0988.05041OpenAlexW4235662368MaRDI QIDQ2725050

Khee Meng Koh, Charles H. C. Little, Michael D. Hendy, Kee L. Teo, Fengming Dong

Publication date: 30 June 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1003

zbMATH Keywords

complete bipartite graphchromatically uniquechromatic equivalence class\(k\)-independent partitions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

On chromatic uniqueness of certain 5-partite graphs ⋮ Chromaticity of complete 6-partite graphs with certain star or matching deleted. II ⋮ Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices ⋮ On Garlands in \(\chi\)-uniquely colorable graphs ⋮ On the chromaticity of complete multipartite graphs with certain edges added

This page was built for publication: Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs