Did you know 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?