Facial Nonrepetitive Vertex Coloring of Plane Graphs
From MaRDI portal
Publication:2852615
DOI10.1002/jgt.21695zbMath1272.05030arXiv1105.1023OpenAlexW3123004055MaRDI QIDQ2852615
Publication date: 9 October 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.1023
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
On the facial Thue choice number of plane graphs via entropy compression method ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ New bounds for facial nonrepetitive colouring ⋮ Fractional Thue chromatic number of graphs ⋮ Every plane graph is facially-non-repetitively \(C\)-choosable ⋮ Nonrepetitive colouring via entropy compression ⋮ Total Thue colourings of graphs ⋮ On a generalization of Thue sequences
Cites Work
- Nonrepetitive colouring via entropy compression
- Nonrepetitive vertex colorings of graphs
- Nonrepetitive colorings of trees
- Pattern avoidance on graphs
- Nonrepetitive colorings of graphs of bounded tree-width
- A new bound on the cyclic chromatic number
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Facial non-repetitive edge-coloring of plane graphs
- Disjoint paths, planarizing cycles, and spanning walks
- On square-free vertex colorings of graphs
- Nonrepetitive colorings of graphs
This page was built for publication: Facial Nonrepetitive Vertex Coloring of Plane Graphs
