Given a graph G and a positive integer i, an i-packing in G is a subset X of V (G) such that the distance dG(u, v) between any two distinct vertices u, v ∈ X is greater than i. The packing chromatic number χρ(G) of a graph ...