The strong chromatic index of 1-planar graphs

Yiqiao Wang, Ning Song, Jianfeng Wang +1

The chromatic index $\ddot{I}{‡}^{\prime }(G)$ of a graph $G$ is the smallest $k$ for which $G$ admits an edge $k$-coloring such that any two adjacent edges have distinct colors. The strong chromati…