On S-Packing Coloring of Subcubic Graphs

Abstract: Given a sequence $S = (s_1, s_2, \ldots, s_k)$ of positive integers with $s_1 \leq s_2 \leq \ldots \leq s_k$, an $S$-packing coloring of a graph $G$ is a partition of $V(G)$ into $k$ subsets $V_1, V_2, \ldots, V_k$ such that for each $1 \leq i \leq k$ the distance between any two distinct $x, y \in V_i$ is at least $s_i + 1$. In 2023, Yang and Wu proved that all 3-irregular subcubic graphs are $(1,1,3)$-packing colorable. In 2024, Mortada and Togni proved that every 1-saturated subcubic graph is $(1, 1, 2)$-packing colorable. In this paper, we provide new, concise proofs for these two theorems using a novel tool.