On the equitable chromatic number of complete \(n\)-partite graphs

DOI10.1016/S0166-218X(00)00296-1zbMath0990.05050OpenAlexW2141130139MaRDI QIDQ5951975

Zhong Fu Zhang, Chong Sze Tong, Wai Chee Shiu, Peter Che Bor Lam

Publication date: 14 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00296-1

zbMATH Keywords

equitable chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs ⋮ Equitable colorings of Kronecker products of graphs ⋮ Equitable oriented coloring ⋮ Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ Equitable colorings of Cartesian products of graphs

Cites Work

• Equitable and proportional coloring of trees
• Equitable coloring and the maximum degree
• On equitable coloring of bipartite graphs
• Equitable Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the equitable chromatic number of complete \(n\)-partite graphs