Every subcubic graph is packing $(1,1,2,2,3)$-colorable

Xujun Liu, Xin Zhang, Yanting Zhang

For a sequence $S=(s_1,\dots ,s_k)$ of non-decreasing integers, a packing $S$-coloring of a graph $G$ is a partition of its vertex set $V(G)$ into $V_1,\dots ,V_k$ such that fo…