Packing chromatic number of unitary Cayley graphs of ${\mathbb{Z}}_n$ and algorithmic approaches to it

Zahra Hamed-Labbafian, Mostafa Tavakoli, Mojgan Afkhami +1

A packing $k$-coloring of a graph $G$ is a partition of $V(G)$ into $k$ disjoint non-empty classes $V_1,\dots ,V_k$, such that if $u,v\in V_i$, $i\in [k]$, $u\ne v$, then the dis…