Petru\v{ s}evski and \v{ S}krekovski \cite{ odd9} recently introduced the notion of an odd colouring of a graph: a proper vertex colouring of a graph $G$ is said to be \emph{ odd} if for each non-isolated vertex $x \in V(G)$ there exists a colour $c$ appearing an odd number of times in $N(x)$. Petru\v{ s}evski and \v{ S}krekovski proved that for any planar graph $G$ there is an odd colouring using at most $9$ colours and, together with Caro \cite{ oddremarks}, showed that $8$ colours are enough for a significant family of planar graphs. We show that $8$ colours suffice for all planar graphs.
Categories: math.CO