A note on non-repetitive colourings of planar graphs
Combinatorics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.math/0307365,
title = {A note on non-repetitive colourings of planar graphs},
author = {Narad Rampersad},
journal= {arXiv preprint arXiv:math/0307365},
year = {2007}
}
Comments
4 pages, 2 figures