Equitable Chromatic Numbers of Derived Graph of Particular Graphs.
An equitable k-coloring is a proper coloring with color classes V_1,V_2,\ldots,V_{k} for which the numbers of vertices in any two color classes differ by at most one. A graph G is equitably k-colorable if there is an equitable k-coloring. The smallest positive integer k such that G is equitably k-colorable is the equit...