A note on the packing chromatic number of lexicographic products

Dragana Božović, Iztok Peterin

The packing chromatic number ${\chi }_{\rho }(G)$ of a graph $G$ is the smallest integer $k$ such that there exists a $k$-vertex coloring of $G$ in which any two vertices receiving color $i$ a…