1 paper
A. V. Kostochka, X. Li, W. Ruksasakchai +3
The strong chromatic index of a multigraph is the minimum k such that the edge set can be k-colored requiring that each color class induces a matching. We verify a conjecture o…