Between proper and square colorings of planar graphs with maximum degree at most four

Xujun Liu, Zihui Xu, Xin Zhang

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