(Georgia Institute of Technology, 2012-05)
Dujmovic, Vida
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the same sequence of colours as the second half. This talk will present some results on nonrepetitive colourings of planar graphs and graphs of bounded degree.