Nonrepetitive list colorings of the integers
From MaRDI portal
Publication:2033476
DOI10.1007/s00026-021-00534-7OpenAlexW3168639355MaRDI QIDQ2033476
Bartosz Zaleski, Barbara Nayar, Bartłomiej Bosek, Jarosław Grytczuk
Publication date: 17 June 2021
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-021-00534-7
Theory of computing (68Qxx) Sequences and sets (11Bxx) Discrete mathematics in relation to computer science (68Rxx) Number theory (11-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Last cases of Dejean's conjecture
- The origins of combinatorics on words
- Thue type problems for graphs, points, and numbers
- Notes on nonrepetitive graph colouring
- Avoidable patterns in strings of symbols
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Another approach to non-repetitive colorings of graphs of bounded degree
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- Nonrepetitive list colourings of paths
- A proof of Dejean’s conjecture
- Words without Near-Repetitions
- Automatic Sequences
- Nonrepetitive colorings of graphs
- New approach to nonrepetitive sequences
This page was built for publication: Nonrepetitive list colorings of the integers
