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.

Additional Metadata
Conference 28th Canadian Conference on Computational Geometry, CCCG 2016
Citation
Bose, P, Dujmović, V, Morin, P, & Rioux-Maldague, L. (Lucas). (2016). New bounds for facial nonrepetitive colouring. In Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016 (pp. 295–302).