  The \textit{packing chromatic number} of a graph $G$, denoted by $%
\chi_\rho(G)$, is the smallest integer $k$ such that the vertex set of $G$ can
be partitioned into sets $V_i$, $i\in \{1,\ldots,k\}$, where each $V_i$ is an
$i$-packing. In this paper, we present some general properties of packing
chromatic numbers of \textit{finite super subdivisions} of graphs. We determine
the packing chromatic numbers of the finite super subdivisions of complete
graphs, cycles and \textit{neighborhood corona graphs} of a cycle and a path
respectively of a complete graph and a path.

Combinatorics