Interval Edge Coloring of Sudha Grid of Hexagons, Gear and Helm Graphs
S. Sudha, G.M. Raja · Annals of Pure and Applied Mathematics · 2017
An arbitrary non-empty finite subset of consecutive positive integers is called an interval in graph theory.An edge coloring of a graph ܩ with colors 1,2, … ݇ is called an ݇-interval edge coloring if all the colors are used so that the colors of the edges incident to any vertex of ܩ are distinct and are consecutive.The interval edge coloring of Sudha grid of hexagons, gear and Helm graphs are stated as theorems in this paper and we found their interval edge chromatic numbers to be 3, ݊ and ݊ respectively.