Nonrepetitive list colorings of the integers
From MaRDI portal
Publication:2033476
Recommendations
- Nonrepetitive list colourings of paths
- On the number of list‐colorings
- A note on list-colorings
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs
- List colorings and reducibility
- scientific article; zbMATH DE number 5531976
- The chromatic polynomial and list colorings
Cites work
- A proof of Dejean’s conjecture
- Analytic combinatorics
- Another approach to non-repetitive colorings of graphs of bounded degree
- Automatic Sequences
- Avoidable patterns in strings of symbols
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Last cases of Dejean's conjecture
- New approach to nonrepetitive sequences
- Nonrepetitive colorings of graphs
- Nonrepetitive list colourings of paths
- Notes on nonrepetitive graph colouring
- On Dejean's conjecture over large alphabets
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Sur un théorème de Thue
- The origins of combinatorics on words
- The probabilistic method
- Thue type problems for graphs, points, and numbers
- Words without Near-Repetitions
Cited in
(3)
This page was built for publication: Nonrepetitive list colorings of the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033476)