Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable

Jingxi Hou, Tao Wang, Xiaojing Yang

For a non-decreasing positive integer sequence $S=(s_1,\dots ,s_k)$, an $S$-packing edge-coloring of a graph $G$ is a partition of the edge set of $G$ into subsets $E_{1}, \…