Equitable coloring of planar graphs with maximum degree at least eight

Alexandr Kostochka, Duo Lin, Zimu Xiang

The Chen-Lih-Wu Conjecture states that each connected graph with maximum degree $\Delta \ge 3$ that is not the complete graph $K_{\Delta +1}$ or the complete bipartite graph $K_{\Delta ,\Delta }$ admits…