A graph is equitably k-colorable if its vertices can be partitioned into k independent sets of as near equal sizes as possible. The equitable △-coloring conjecture asserts that a connected graph G is equitably △(G)-colorable if it is different from K_m, C_2m+1 and K_2m+1,2m+1 for all m≧1.