Grundy Packing Coloring of Graphs

Didem Gözüpek, Iztok Peterin

A map $c:V(G)\to \{1,\dots ,k\}$ of a graph $G$ is a packing $k$-coloring if every two different vertices of the same color $i\in \{1,\dots ,k\}$ are at distance more than $i$…