9 citations · 39 across the 35 of their papers we have counts for
1 paper · 1 filter
Yanli Hao, Tianchi Yang, Xingxing Yu
An edge-coloring of a graph G is called a strong edge-coloring if all its color classes are induced matchings in G; the minimum number of colors required for such a coloring, d…