Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
From MaRDI portal
Publication:2911051
DOI10.1002/jgt.20630zbMath1248.05069OpenAlexW1487816497MaRDI QIDQ2911051
Alexandr V. Kostochka, Henry A. Kierstead
Publication date: 12 September 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20630
Related Items (13)
On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ Equitable vertex arboricity of 5-degenerate graphs ⋮ Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ A note on relaxed equitable coloring of graphs ⋮ Extremal numbers for disjoint copies of a clique ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ A refinement of a result of Corrádi and Hajnal ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Equitable partition of planar graphs ⋮ On equitable colorings of sparse graphs ⋮ Equitable total-coloring of subcubic graphs ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
Cites Work
- A fast algorithm for equitable coloring
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- An Ore-type theorem on equitable coloring
- Perfect Graphs and an Application to Optimizing Municipal Services
- Unnamed Item
- Unnamed Item
This page was built for publication: Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
