Total Thue colourings of graphs

DOI10.1007/s40879-014-0016-2zbMath1310.05098arXiv1309.3164MaRDI 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 sequence; nonrepetitive graph colouring; total thue chromatic number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

05C07: Vertex degrees

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Related Items

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

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