2-distance 20-coloring of planar graphs with maximum degree 6

Kengo Aoki

A 2-distance $k$-coloring of a graph $G$ is a proper $k$-coloring such that any two vertices at distance two or less get different colors. The 2-distance chromatic number of $G$ is…