2 citations · 2 across the 2 of their papers we have counts for
1 paper · 2 filters
Suresh Dara, Suchismita Mishra, Narayanan Narayanan +1
A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the stron…