Notes on complexity of packing coloring

Minki Kim, Bernard Lidický, Tomáš Masařík +1

A packing $k$-coloring for some integer $k$ of a graph $G=(V,E)$ is a mapping $\phi :V\to \{1,\dots ,k\}$ such that any two vertices $u,v$ of color $\phi (u)=\phi (v)$ are in distance at least…