The Packing Coloring of Distance Graphs $D(k,t)$

Jan Ekstein, Přemysl Holub, Olivier Togni

The packing chromatic number ${\chi }_{\rho }(G)$ of a graph $G$ is the smallest integer $p$ such that vertices of $G$ can be partitioned into disjoint classes $X_1,...,X_p$ where vertic…