42 citations · 109 across the 37 of their papers we have counts for
1 paper · 1 filter
Michał Dębski, Jarosław Grytczuk, Małgorzata Śleszyńska-Nowak
A coloring of the edges of a graph G is strong if each color class is an induced matching of G. The strong chromatic index of G, denoted by χs′(G), is the least…