An upper bound for the equitable chromatic number of complete n-partite graphs

A proper vertex coloring of a graph $G$ is equitable if the size of color classes differ by at most one. The equitable chromatic number of $G$ is the smallest integer $m$ such that $G$ is equitable m-colorable. In this paper, we derive an upper bound for the equitable chromatic number of complete n-partite graph $K_{p_{1},p_{2}, ... ,p_{n}}$