On the precise value of the strong chromatic-index of a planar graph with a large girth

Gerard Jennhwa Chang, Guan-Huei Duh

A strong $k$-edge-coloring of a graph $G$ is a mapping from $E(G)$ to $\{1,2,\dots ,k\}$ such that every pair of distinct edges at distance at most two receive different colors. Th…