Packing coloring of Sierpiński-type graphs

Boštjan Brešar, Jasmina Ferme

The packing chromatic number ${\chi }_{\rho }(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $i\in \{1,\dots ,k\}$, where ea…