New bounds for facial nonrepetitive colouring
From MaRDI portal
Publication:2409520
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.
Cites work
- scientific article; zbMATH DE number 1740032 (Why is no real title available?)
- Facial non-repetitive edge-coloring of plane graphs
- Facial nonrepetitive vertex coloring of plane graphs
- Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004
- New approach to nonrepetitive sequences
- Non-repetitive 3-coloring of subdivided graphs
- Nonrepetitive choice number of trees
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs -- a survey
- Nonrepetitive colorings of graphs of bounded tree-width
- Nonrepetitive colorings of trees
- Nonrepetitive colouring via entropy compression
- Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
- Nonrepetitive vertex colorings of graphs
- Notes on nonrepetitive graph colouring
- On square-free vertex colorings of graphs
- On the facial Thue choice index of plane graphs
- On the facial Thue choice index via entropy compression
- Pathwidth and nonrepetitive list coloring
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Thue choosability of trees
- Total Thue colourings of graphs
Cited in
(2)
This page was built for publication: New bounds for facial nonrepetitive colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409520)
