Equivalence of two conjectures on equitable coloring of graphs

DOI10.1007/s10878-011-9429-8zbMath1273.90223OpenAlexW1976812424WikidataQ123019136 ScholiaQ123019136MaRDI QIDQ1956256

Chih-Hung Yen, Bor-Liang Chen, Ko-Wei Lih

Publication date: 13 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9429-8

zbMATH Keywords

independence numbermaximum degreeequitable coloring\(r\)-equitable graphmaximum coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs ⋮ Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ Equitable \(\Delta\)-coloring of graphs ⋮ Unnamed Item ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

Cites Work

• Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
• Chromatic coloring with a maximum color class
• Equitable coloring and the maximum degree
• Equitable Coloring
• Unnamed Item

This page was built for publication: Equivalence of two conjectures on equitable coloring of graphs