Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours

Vida Dujmović, Fabrizio Frati, Gwenaël Joret +1

A vertex colouring of a graph is \emph{nonrepetitive} if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The \emp…