Packing $(1,1,2,4)$-coloring of subcubic outerplanar graphs

Alexandr Kostochka, Xujun Liu

For $1\le s_1\le s_2\le \dots \le s_k$ and a graph $G$, a packing $(s_1,s_2,\dots ,s_k)$-coloring of $G$ is a partition of $V(G)$ into sets $V_1,V_2,\dots ,V_k$ such that…