Journal Nonlinear Analysis and Application, Volume (2014), No (1), Year (2014-10) , Pages (1-7)

Title : ( An upper bound for the equitable chromatic number of complete n-partite graphs )

Authors: Freydoon Rahbarnia , ,
File:

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

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 Kp1;p2;:::;pn .

Keywords

, Complete n-partite graph, Equitable chromatic number.