Packing Chromatic Number of Distance Graphs

Jan Ekstein, Přemysl Holub, Bernard Lidický

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