Square Coloring of Planar Graphs with Maximum Degree at Most Five

Jiani Zou, Miaomiao Han, Hong-Jian Lai

The \textit{square} of a graph $G$, denoted by $G^2$, is obtained from $G$ by adding an edge to connect every pair of vertices with a common neighbor in $G$. In this paper we prove…