Packing chromatic critical graphs with radius at most 2

Aslıhan Gür, Didem Gözüpek, Hadi Alizadeh

For a graph $G$ with vertex set $V(G)$ and a positive integer $i$, an $i$-packing in $G$ is a subset $X$ of $V(G)$ such that the distance between any two distinct vertices of $X$ i…