Nonrepetitive list colourings of paths
From MaRDI portal
Publication:3068765
DOI10.1002/RSA.20347zbMATH Open1217.05090OpenAlexW2126605343MaRDI QIDQ3068765FDOQ3068765
Authors: Jarosław Grytczuk, Jakub Przybyło, Xuding Zhu 
Publication date: 17 January 2011
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20347
Recommendations
- \((2+\epsilon )\)-nonrepetitive list colouring of paths
- Nonrepetitive choice number of trees
- Nonrepetitive graph colouring
- Thue choosability of trees
- Pathwidth and nonrepetitive list coloring
- Nonrepetitive colorings of graphs
- scientific article; zbMATH DE number 1496580
- Total Thue colourings of graphs
- Nonrepetitive colorings of graphs
- Some new bounds on \(T_{r}\)-choosability
Cites Work
- Avoidable patterns in strings of symbols
- Automatic Sequences
- Graph minors. V. Excluding a planar graph
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Thue choosability of trees
- Nonrepetitive colorings of graphs -- a survey
- Thue type problems for graphs, points, and numbers
- Highly nonrepetitive sequences: winning strategies from the local Lemma
- Pattern avoidance: themes and variations
- On square-free vertex colorings of graphs
- Non-repetitive 3-coloring of subdivided graphs
Cited In (23)
- Avoiding squares over words with lists of size three amongst four symbols
- Nonrepetitive choice number of trees
- Nonrepetitive graph colouring
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs
- \((2+\epsilon )\)-nonrepetitive list colouring of paths
- On the facial Thue choice number of plane graphs via entropy compression method
- Efficient counting of square substrings in a tree
- Thue choosability of trees
- On the facial Thue choice index of plane graphs
- Nonrepetitive colouring via entropy compression
- Extensions and reductions of squarefree words
- Facially-constrained colorings of plane graphs: a survey
- Nonrepetitive list colorings of the integers
- Another approach to non-repetitive colorings of graphs of bounded degree
- On the facial Thue choice index via entropy compression
- Restricted coloring problems on graphs with few \(P_4\)'s
- On a generalization of Thue sequences
- The local cut lemma
- Pathwidth and nonrepetitive list coloring
- Total Thue colourings of graphs
- A note on the thue chromatic number of lexicographic products of graphs
- New approach to nonrepetitive sequences
This page was built for publication: Nonrepetitive list colourings of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068765)
