1 paper
Tianjiao Dai, Guanghui Wang, Donglei Yang +1
A strong k-edge-coloring of a graph G is an edge-coloring with k colors in which every color class is an induced matching. The strong chromatic index of G, denoted by $χ'_{s}…