Equitable colorings of bounded treewidth graphs

A proper coloring of a graph G is equitable if the sizes of any two color classes are di#er by at most one. The related notion is #-bounded coloring where each of the color classes is of cardinality #. We consider the problems to determine for a given graph G (and a given integer #) whether G has an equitable (#-bounded) coloring