2003/07/28 by Narad Rampersad, Rampersad, Narad
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #05C15 #Combinatorics (math.CO) #DNA and Biological Computing #FOS: Mathematics #graph theory and CDMA systems #math.CO #msc:05C15 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0307365
4 pages, 2 figures
arxiv created 2003/07/28 · openalex publication_date 2003/07/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.