Packing coloring of generalized Sierpinski graphs

Danilo Korze, Aleksander Vesel

The packing chromatic number ${\chi }_{\rho }(G)$ of a graph $G$ is the smallest integer $c$ such that the vertex set $V(G)$ can be partitioned into sets $X_1,...,X_c$, with the condition…