A note on non-repetitive colourings of planar graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
4 pages, 2 figures

Keywords

Combinatorics, 05C15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/68190

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0307365
 http://arxiv.org/abs/math/0307365

Collections

arXiv