A proper vertex coloring of a graph is equitable if the sizes of color classes di2er by at most 1. In this note, we prove the conjecture of Yap and Zhang that every outerplanar graph
['Alexandr V. Kostochka']
Equitable colorings of outerplanar graphs