Strong chromatic index of sparse graphs

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 ${\chi }_s^{\prime }(G)$, is the least…