Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring

Henry A. Kierstead, Alexandr V. Kostochka. Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. Journal of Graph Theory, 71(1):31-48, 2012. [doi]

Abstract

Abstract is missing.