Equitable Coloring for Union of Graphs

Abstract

Let be a finite, undirected and simple graph. A proper vertex coloring of a graph of  is equitable if the sizes of color classes differ by atmost. The equitable chromatic number of a graph G, denoted byis the minimum k such that  is equitably -colorable. We shall discuss about an equitable coloring for union of two graphs.