Equitable coloring of planar graphs without 4,5,6-cycles
Jianliang Wu · Journal of Shandong University · 2008
A proper vertex-coloring φ of a graph G is called an equitable coloring of G if the numbers of vertices in any two-color class differ with each other at most one.Then any planar graph G without 4,5,6-cycles and with Δ≥9 is equitable Δ-colorable.