The tight bound for the strong chromatic indices of claw-free subcubic graphs

Yuquan Lin, Wensong Lin

Let $G$ be a graph and $k$ a positive integer. A strong $k$-edge-coloring of $G$ is a mapping $\varphi :E(G)\to \{1,2,\dots ,k\}$ such that for any two edges $e$ and $e^{\prime }$ that are either…