Packing chromatic numbers of finite super subdivisions of graphs

Rachid Lemdani, Moncef Abbas, Jasmina Ferme

The \textit{packing chromatic number} of a graph $G$, denoted by , is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $i\in \…