Nonrepetitive list colourings of paths
From MaRDI portal
Publication:3068765
DOI10.1002/rsa.20347zbMath1217.05090OpenAlexW2126605343MaRDI QIDQ3068765
Jakub Przybyło, Jarosław Grytczuk, 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
Related Items
On the facial Thue choice number of plane graphs via entropy compression method, \((2+\epsilon )\)-nonrepetitive list colouring of paths, A note on the thue chromatic number of lexicographic products of graphs, On the Facial Thue Choice Index via Entropy Compression, Facially-constrained colorings of plane graphs: a survey, Avoiding squares over words with lists of size three amongst four symbols, Thue choosability of trees, Another approach to non-repetitive colorings of graphs of bounded degree, On the facial Thue choice index of plane graphs, Extensions and reductions of squarefree words, Restricted coloring problems on graphs with few \(P_4\)'s, Pathwidth and nonrepetitive list coloring, New approach to nonrepetitive sequences, Nonrepetitive colouring via entropy compression, Efficient counting of square substrings in a tree, Nonrepetitive list colorings of the integers, Total Thue colourings of graphs, On a generalization of Thue sequences, The local cut lemma
Cites Work
- Thue choosability of trees
- Pattern avoidance: themes and variations
- Nonrepetitive colorings of graphs -- a survey
- Thue type problems for graphs, points, and numbers
- Non-repetitive 3-coloring of subdivided graphs
- Graph minors. V. Excluding a planar graph
- Avoidable patterns in strings of symbols
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Highly nonrepetitive sequences: Winning strategies from the local lemma
- On square-free vertex colorings of graphs
- Automatic Sequences
