$S$-packing colorings of distance graphs with distance sets of cardinality $2$

Boštjan Brešar, Jasmina Ferme, Přemysl Holub +2

For a non-decreasing sequence $S=(s_1,s_2,\dots )$ of positive integers, a partition of the vertex set of a graph $G$ into subsets $X_1,\dots ,X_{\ell }$, such that vertices in $X_i$…