On the Packing Chromatic Number on Hamming Graphs and General Graphs

Graciela Nasini, Daniel Severin, Pablo Torres

The packing chromatic number ${\chi }_{\rho }(G)$ of a graph $G$ is the smallest integer $k$ needed to proper color the vertices of $G$ in such a way the distance between any two vertices havi…