Strong Chromatic Index of Chordless Graphs
Strong Chromatic Index of Chordless Graphs
Abstract A strong edge coloring of a graph is an assignment of colors to the edges of the graph such that for every color, the set of edges that are given that color form an induced matching in the graph. The strong chromatic index of a graph G , denoted …