On the packing chromatic number of Moore graphs

Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen

The \emph{packing chromatic number ${\chi }_{\rho }(G)$} of a graph $G$ is the smallest integer $k$ for which there exists a vertex coloring $\Gamma :V(G)\to \{1,2,\dots ,k\}$ such that an…