A note on non-repetitive colourings of planar graphs

Simple item page
dc.creatorRampersad, Narad
dc.date2003-07-28
dc.date.accessioned2026-07-07T04:59:56Z
dc.date.available2026-07-07T04:59:56Z
dc.descriptionAlon 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.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0307365
dc.identifierhttp://arxiv.org/abs/math/0307365
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68190
dc.subjectCombinatorics
dc.subject05C15
dc.titleA note on non-repetitive colourings of planar graphs
dc.typetext

Files

Collections

arXiv