Equitable \(\Delta\)-coloring of graphs

DOI10.1016/j.disc.2011.05.020zbMath1239.05061OpenAlexW1716408756MaRDI QIDQ411652

Bor-Liang Chen, Chih-Hung Yen

Publication date: 30 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.020

zbMATH Keywords

bipartite graphschromatic numbermaximum degreeequitable coloringsubcubic graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ 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 vertex arboricity of 5-degenerate graphs ⋮ Equitable vertex arboricity of graphs ⋮ Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs ⋮ Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ On equitable colorings of sparse graphs ⋮ 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
• On equitable coloring of bipartite graphs
• Equivalence of two conjectures on equitable coloring of graphs
• Equitable Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable \(\Delta\)-coloring of graphs