A note on non-repetitive colourings of planar graphs

Details A note on non-repetitive colourings of planar graphs A note on non-repetitive colourings of planar graphs

2003-07-28

arxiv.org/abs/math/0307365v1

Mathematics

Combinatorics

4 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A note on non-repetitive colourings of planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on non-repetitive colourings of planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on non-repetitive colourings of planar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108116