Planar Graphs with Ore-degree at Most seven is strongly $13$-edge-colorable

Seth Nelson, Gexin Yu

A strong edge-coloring of a graph $G$ is a coloring of edges of $G$ such that every color class forms an induced matching. The strong chromatic index is the minimum number of color…