Recognition: unknown
New Bounds for Facial Nonrepetitive Colouring
classification
🧮 math.CO
keywords
facialgraphnonrepetitiveboundschromaticcolouringnumberouterplanar
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.