Graphs that are critical for the packing chromatic number

Boštjan Brešar, Jasmina Ferme

Given a graph $G$, a coloring $c:V(G)⟶\{1,\dots ,k\}$ such that $c(u)=c(v)=i$ implies that vertices $u$ and $v$ are at distance greater than $i$, is called a packing…