New Bounds for Facial Nonrepetitive Colouring
Combinatorics
2016-04-06 v1
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.
Keywords
Cite
@article{arxiv.1604.01282,
title = {New Bounds for Facial Nonrepetitive Colouring},
author = {Prosenjit Bose and Vida Dujmović and Pat Morin and Lucas Rioux-Maldague},
journal= {arXiv preprint arXiv:1604.01282},
year = {2016}
}
Comments
16 pages, 5 figures