Narad Rampersad
Published 2003-07-28Version 1
Alon et al. introduced the concept of non-repetitive colourings of graphs. Here we address some questions regarding non-repetitive colourings of planar graphs. Specifically, we show that the faces of any outerplanar map can be non-repetitively coloured using at most five colours. We also give some lower bounds for the number of colours required to non-repetitively colour the vertices of both outerplanar and planar graphs.
Comments: 4 pages, 2 figures
Crossings, colorings, and cliques
Upper and lower bounds on $B_k^+$-sets
Lower bounds on maximal determinants of binary matrices via the probabilistic method
![QR code for arXiv:math/0307365 [math.CO]](http://oss.arxitics.com/images/favicon.svg)