Facial non-repetitive edge-coloring of plane graphs

DOI10.1002/jgt.20488zbMath1222.05059MaRDI 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

zbMATH Keywords

tree; edge coloring; plane graph; non-repetitive; thue sequences

Mathematics Subject Classification ID

05C05: Trees

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

On the facial Thue choice number of plane graphs via entropy compression method, On the facial Thue choice index of plane graphs, Nonrepetitive colouring via entropy compression, Nonrepetitive vertex colorings of graphs, A note on the thue chromatic number of lexicographic products of graphs, Total Thue colourings of graphs, Unique-maximum edge-colouring of plane graphs with respect to faces, On a generalization of Thue sequences, Facial anagram-free edge-coloring of plane graphs, Facially-constrained colorings of plane graphs: a survey, New bounds for facial nonrepetitive colouring, Facial Nonrepetitive Vertex Coloring of Plane Graphs, On the Facial Thue Choice Index via Entropy Compression

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