New Bounds for Facial Nonrepetitive Colouring

2016/04/05 by Bose, Prosenjit, Dujmović, Vida, Morin, Pat +1
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1604.01282

Abstract

We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and of any planar graph is at most 22.

Related

• A note on non-repetitive colourings of planar graphs
• 3-facial colouring of plane graphs
• Odd colourings, conflict-free colourings and strong colouring numbers
• Queue layouts and nonrepetitive colouring of planar graphs and powers of trees
• Oriented Colourings of Graphs with Maximum Degree Three and Four