Extensions and reductions of squarefree words
From MaRDI portal
Publication:6177427
DOI10.1016/j.disc.2023.113825arXiv2209.08507MaRDI QIDQ6177427
Michał Dębski, Bartłomiej Pawlik, Jarosław Grytczuk
Publication date: 17 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.08507
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Last cases of Dejean's conjecture
- Pattern avoidance: themes and variations
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- The origins of combinatorics on words
- Thue type problems for graphs, points, and numbers
- Nonrepetitive colorings of graphs of bounded tree-width
- Avoidable patterns in strings of symbols
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Online version of the theorem of Thue
- Disposability in square-free words
- Lengths of irreducible and delicate words
- Another approach to non-repetitive colorings of graphs of bounded degree
- A note about online nonrepetitive coloring \(k\)-trees
- Extremal square-free words
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- Squarefree words with interior disposable factors
- Nonrepetitive list colourings of paths
- A proof of Dejean’s conjecture
- Automatic Sequences
- New approach to nonrepetitive sequences
- Lengths of extremal square-free ternary words.
- No extremal square-free words over large alphabets
- Avoiding squares over words with lists of size three amongst four symbols
- Planar graphs have bounded nonrepetitive chromatic number
This page was built for publication: Extensions and reductions of squarefree words
