Author/Authors :
RAHBARNIA، F. نويسنده Department of Mathematics, Ferdowsi University of Mashhad, P. O. Box 1159, Mashhad 91775, Iran , , Moaied، M. نويسنده School of Mathematical Sciences, Ferdowsi University of Mashhad, P.O. Box 1159-91775, Mashhad, Iran ,
Abstract :
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 .
