New bounds for facial nonrepetitive colouring

DOI10.1007/s00373-017-1816-1zbMath1371.05075arXiv1604.01282OpenAlexW2963152465MaRDI QIDQ2409520

Prosenjit Bose, Pat Morin, Lucas Rioux-Maldague, Vida Dujmović

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.01282

zbMATH Keywords

outerplanar graphfacial nonrepetitive chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

Facial anagram-free edge-coloring of plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Thue choosability of trees
• On the facial Thue choice index of plane graphs
• Pathwidth and nonrepetitive list coloring
• Nonrepetitive colouring via entropy compression
• Nonrepetitive vertex colorings of graphs
• Nonrepetitive colorings of trees
• Nonrepetitive colorings of graphs -- a survey
• Nonrepetitive colorings of graphs of bounded tree-width
• Notes on nonrepetitive graph colouring
• Non-repetitive 3-coloring of subdivided graphs
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
• Total Thue colourings of graphs
• Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004
• Facial Nonrepetitive Vertex Coloring of Plane Graphs
• Facial non-repetitive edge-coloring of plane graphs
• On square-free vertex colorings of graphs
• Nonrepetitive colorings of graphs
• New approach to nonrepetitive sequences
• Nonrepetitive Choice Number of Trees

This page was built for publication: New bounds for facial nonrepetitive colouring