Diamond-free, claw-free cubic graphs are (1, 1, 2, 3)-packing colorable

Sarah E. Anderson, Kirsti Kuenzel, Juan D. Marcano Cuellar

A $(1,1,2,k)$-packing coloring of a graph $G$ is a partition of $V(G)$ into two independent sets, a 2-packing, and a $k$-packing. Recently, the question was posed in [A short pr…