On a generalization of Thue sequences

zbMath1314.68251MaRDI QIDQ2346472

Borut Lužar, Jaka Kranjc, Roman Soták, Martina Mockovčiaková

Publication date: 2 June 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p33

zbMATH Keywords

Thue sequence\(k\)-Thue sequencetotal Thue chromatic number

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coloring of graphs and hypergraphs (05C15)

Related Items

On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\), Grasshopper avoidance of patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Thue choosability of trees
• On the facial Thue choice index of plane graphs
• Growth properties of power-free languages
• Pattern avoidance: themes and variations
• Nonrepetitive sequences on arithmetic progressions
• The origins of combinatorics on words
• Nonrepetitive colorings of graphs -- a survey
• Strongly non-repetitive sequences and progression-free sets
• A word on 7 letters which is non-repetitive up to mod 5
• Non-repetitive tilings
• Thue-like sequences and rainbow arithmetic progressions
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Total Thue colourings of graphs
• The fixing block method in combinatorics on words
• Which graphs allow infinite nonrepetitive walks?
• Facial Nonrepetitive Vertex Coloring of Plane Graphs
• On the Facial Thue Choice Index via Entropy Compression
• Facial non-repetitive edge-coloring of plane graphs
• Nonrepetitive list colourings of paths
• Nonrepetitive colorings of graphs
• Abelian squares are avoidable on 4 letters