Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
From MaRDI portal
Publication:2725050
DOI10.1002/jgt.1003zbMath0988.05041MaRDI QIDQ2725050
Khee Meng Koh, Charles H. C. Little, Fengming Dong, Michael D. Hendy, Kee L. Teo
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
complete bipartite graph; chromatically unique; chromatic equivalence class; \(k\)-independent partitions
05C15: Coloring of graphs and hypergraphs