New bounds for facial nonrepetitive colouring
From MaRDI portal
Publication:2409520
DOI10.1007/S00373-017-1816-1zbMATH Open1371.05075arXiv1604.01282OpenAlexW2963152465MaRDI QIDQ2409520FDOQ2409520
Authors: Prosenjit Bose, Pat Morin, Lucas Rioux-Maldague, Vida Dujmović 
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1604.01282
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- New approach to nonrepetitive sequences
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Facial nonrepetitive vertex coloring of plane graphs
- On the facial Thue choice index via entropy compression
- Facial non-repetitive edge-coloring of plane graphs
- Thue choosability of trees
- On the facial Thue choice index of plane graphs
- Nonrepetitive colorings of graphs
- Nonrepetitive colouring via entropy compression
- Nonrepetitive vertex colorings of graphs
- Nonrepetitive colorings of graphs -- a survey
- Nonrepetitive colorings of graphs of bounded tree-width
- Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
- Nonrepetitive colorings of trees
- Notes on nonrepetitive graph colouring
- On square-free vertex colorings of graphs
- Pathwidth and nonrepetitive list coloring
- Nonrepetitive choice number of trees
- Non-repetitive 3-coloring of subdivided graphs
- Total Thue colourings of graphs
- Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004
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)
