Qual Hue Coloring For Graphs Union

Abstract

Let G be a simple, finite, and undirected graph. If there is at most a one-size difference in the sizes of the color classes, then a graph of G has an equitable vertex coloring. The least k that makes a graph G equitably k-colorable is its equitable chromatic number, shown by,\. We will talk about a fair coloring scheme for the union of two graphs.