A proper coloring of a graph is equitable if the sizes of any two color classes differ by at most one. We begin by the equitable colorings of the tree, and then add the edges to it, becoming various graphs with cycles. After that we classify them according to their characters, then work out the equitable colorings of these graphs respectively.
展开▼
