A QUESTION ON RELAXED EQUITABLE COLORING

DOI10.1142/S1793830912500425zbMath1251.05058OpenAlexW2099674692MaRDI QIDQ3166752

No author found.

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830912500425

zbMATH Keywords

equitable coloringOre-typerelaxed equitable coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Relaxed coloring of a graph
• A note on relaxed equitable coloring of graphs
• An Ore-type theorem on equitable coloring
• Ore-type graph packing problems
• Bounds for the vertex linear arboricity
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency

This page was built for publication: A QUESTION ON RELAXED EQUITABLE COLORING