An algorithmic approach to equitable edge chromatic number of graphs

Abstract

The equitable edge chromatic number is the minimum number of colors required to color the edges of graph G, for which G has a proper edge coloring and if the number of edges in any two color classes differ by at most one. In this paper, we obtain the equitable edge chromatic number of S?, Wn, Hn and Gn.