Facial non-repetitive edge-coloring of plane graphs
From MaRDI portal
Publication:3067060
DOI10.1002/jgt.20488zbMath1222.05059OpenAlexW1983953277MaRDI QIDQ3067060
Roman Soták, Frédéric Havet, Erika Fecková Škrabuľáková, Stanlislav Jendroľ
Publication date: 20 January 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00638439/file/nonrepet-soumis.pdf
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
On the facial Thue choice number of plane graphs via entropy compression method ⋮ A note on the thue chromatic number of lexicographic products of graphs ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ On the Facial Thue Choice Index via Entropy Compression ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ New bounds for facial nonrepetitive colouring ⋮ On the facial Thue choice index of plane graphs ⋮ Nonrepetitive vertex colorings of graphs ⋮ Nonrepetitive colouring via entropy compression ⋮ Facial Nonrepetitive Vertex Coloring of Plane Graphs ⋮ Total Thue colourings of graphs ⋮ Unique-maximum edge-colouring of plane graphs with respect to faces ⋮ On a generalization of Thue sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Pattern avoidance: themes and variations
- Pattern avoidance on graphs
- Thue type problems for graphs, points, and numbers
- Non-repetitive 3-coloring of subdivided graphs
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Non-repetitive colorings of infinite sets
- On square-free vertex colorings of graphs
- Open Problems in Pattern Avoidance
- Trees in Polyhedral Graphs
- A Theorem on Coloring the Lines of a Network
This page was built for publication: Facial non-repetitive edge-coloring of plane graphs
