equitable coloring
... that an equitable coloring of a graph , in which the numbers of vertices of each color are as nearly equal as possible, may require far more colors than a graph coloring without this constraint?
... that an <b id="mwD-A"><a href="./Equitable_coloring" id="mwD-E" rel="mw:WikiLink" title="Equitable coloring">equitable coloring</a></b> of a <a class="mw-redirect" href="./Undirected_graph" id="mwD-I" rel="mw:WikiLink" title="Undirected graph">graph</a> <i id="mwD-M">(pictured)</i>, in which the numbers of vertices of each color are as nearly equal as possible, may require far more colors than a <a href="./Graph_coloring" id="mwD-Q" rel="mw:WikiLink" title="Graph coloring">graph coloring</a> without this constraint?