On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs

Xujun Liu, Jiacheng Yang, Xin Zhang

For positive integers $\ell$ and $k$, a $(1^{\ell },2^k)$-packing edge-coloring of a graph $G$ is a partition of $E(G)$ into $\ell$ matchings and $k$ induced matchings. A graph is $d…