Uniform colorings of graphs

Let uniform proper coloring of a graph be a proper coloring in which all colors have equal numbers of vertices. We prove new conditions of existence of uniform colorings.