Between proper and square colorings of sparse graphs

Ilkyoo Choi, Xujun Liu

An $i$-independent set is a set of vertices whose pairwise distance is at least $i+1$. A proper coloring (resp. a square coloring) of a graph is a partition of its vertices into in…