How to play Thue games

DOI10.1016/j.tcs.2015.03.036zbMath1310.68174OpenAlexW2093556638MaRDI QIDQ2342675

Michał Zmarz, Karol Kosiński, Jarosław Grytczuk

Publication date: 29 April 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.036

zbMATH Keywords

gamesnon-repetitive sequencesoverlap-free sequencesAxel Thue

Mathematics Subject Classification ID

2-person games (91A05) Combinatorics on words (68R15) Applications of game theory (91A80)

Related Items (2)

A note on Thue games ⋮ Corrigendum to ``A note on Thue games

Cites Work

• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Pattern avoidance: themes and variations
• The origins of combinatorics on words
• Thue type problems for graphs, points, and numbers
• A generalization of Thue freeness for partial words
• Highly nonrepetitive sequences: Winning strategies from the local lemma
• A constructive proof of the general lovász local lemma
• Automatic Sequences
• Nonrepetitive colorings of graphs
• New approach to nonrepetitive sequences

This page was built for publication: How to play Thue games