2-distance 4-coloring of planar subcubic graphs with girth at least 21

Hoang La, Mickael Montassier

A $2$-distance $k$-coloring of a graph is a proper vertex $k$-coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance $4…