A note on relaxed equitable coloring of graphs

DOI10.1016/j.ipl.2011.08.001zbMath1260.05057OpenAlexW2001714541MaRDI QIDQ1944202

Theodore Molla, Xin Zhang, Hao Fan, Jian Liang Wu, Gui Zhen Liu, Henry A. Kierstead

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.08.001

zbMATH Keywords

graph algorithmsequitable coloringrelaxed coloringdeficit coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

A QUESTION ON RELAXED EQUITABLE COLORING ⋮ The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ Equitable vertex arboricity of graphs ⋮ The equitable vertex arboricity of complete tripartite graphs ⋮ On the equitable vertex arboricity of graphs ⋮ On the equitable vertex arboricity of complete tripartite graphs ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ Equitable partition of plane graphs with independent crossings into induced forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for equitable coloring
• Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
• Planar graphs are 1-relaxed, 4-choosable
• Set theory. An introduction to independence proofs
• Equitable coloring and the maximum degree
• Relaxed coloring of a graph
• An Ore-type theorem on equitable coloring
• Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
• Bounds for the vertex linear arboricity
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Equitable Coloring

This page was built for publication: A note on relaxed equitable coloring of graphs