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

Xujun Liu, Gexin Yu

An induced matching in a graph $G$ is a matching such that its end vertices also induce a matching. A $(1^{\ell },2^k)$-packing edge-coloring of a graph $G$ is a partition of its e…