On the (1^2, 2^4)-packing edge-coloring of subcubic graphs
Gexin Yu
The paper confirms that every connected subcubic graph with more than 70 vertices is $(1^{2}, 2^{4})$-packing edge-colorable, affirming the conjecture by Gastineau, Togni, Hocquard, Lajou, and Lušar, while noting the existence of subcubic graphs that are not ** packing edge-colorable.