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

Seog-Jin Kim, Xujun Liu, Boyan Xu

A $(1^j,2^k)$-packing edge-coloring of a graph $G$ is a partition of the edge set $E(G)$ into $j$ matchings and $k$ induced matchings. Hocquard, Lajou, and Lu\v zar found a subcubi…