# Wegner

## Colouring the square of a planar graph ★★

Author(s): Wegner

Conjecture   Let be a planar graph of maximum degree . The chromatic number of its square is
\item at most if , \item at most if , \item at most if .

Keywords: