Total Thue colourings of graphs

DOI10.1007/s40879-014-0016-2zbMath1310.05098arXiv1309.3164OpenAlexW1972748334MaRDI QIDQ2340970

Jens Schreyer, Erika Fecková Škrabuľáková

Publication date: 21 April 2015

Published in: European Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

nonrepetitive sequencenonrepetitive graph colouringtotal thue chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (3)

New bounds for facial nonrepetitive colouring ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ On a generalization of Thue sequences

Cites Work

• Unnamed Item
• On the facial Thue choice index of plane graphs
• Nonrepetitive colouring via entropy compression
• Nonrepetitive colorings of trees
• Thue type problems for graphs, points, and numbers
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Facial Nonrepetitive Vertex Coloring of Plane Graphs
• Facial non-repetitive edge-coloring of plane graphs
• Nonrepetitive list colourings of paths
• On square-free vertex colorings of graphs
• Open Problems in Pattern Avoidance
• Nonrepetitive colorings of graphs
• New approach to nonrepetitive sequences
• Nonrepetitive colorings of graphs

This page was built for publication: Total Thue colourings of graphs