SavedAdd your journal

Journals / TWMS (Turkic World Mathematical Society) Journal of Applied and Engineering Mathematics / 2019 / Cilt: 9 - Sayı: 2

AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS

Venınstıne VIVIK J,GIRIJA G.

Pages
374–383
DOI
—

Özet

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 Sn, Wn, Hn and Gn.