“…If S 1 = (s 1 1 , s and G admits an S 2 -packing k-coloring, then, clearly, G also admits an S 1 -packing k-coloring. In [11,Theorem 3.1], Gastineau proved the following appealing dichotomy result: If S is a packing sequence with |S| = 4, then the decision problem whether a given graph G admits an S-packing coloring is polynomial-time solvable if S S ′ , where S ′ ∈ { (2,3,3,3), (2,2,3,4), (1,4,4,4), (1,2,5,6)}, and NP-complete otherwise.…”