A note on non-repetitive colourings of planar graphs
From MaRDI portal
Publication:6473045
arXivmath/0307365MaRDI QIDQ6473045FDOQ6473045
Publication date: 28 July 2003
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.
This page was built for publication: A note on non-repetitive colourings of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6473045)
