New Bounds for Facial Nonrepetitive Colouring

arxiv: 1604.01282 · v1 · pith:MPEYCOITnew · submitted 2016-04-05 · 🧮 math.CO

Prosenjit Bose , Vida Dujmovi\'c , Pat Morin , Lucas Rioux-Maldague This is my paper

classification 🧮 math.CO

keywords facialgraphnonrepetitiveboundschromaticcolouringnumberouterplanar

0 comments

read the original 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.

This paper has not been read by Pith yet.