\((2+\epsilon )\)-nonrepetitive list colouring of paths

DOI10.1007/s00373-015-1652-0zbMath1342.05054OpenAlexW2260699346MaRDI QIDQ2631100

Huanhua Zhao, Xuding Zhu

Publication date: 28 July 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1652-0

zbMATH Keywords

pathentropy methodnon-repetitive chromatic numbernon-repetitive list colouring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Avoiding squares over words with lists of size three amongst four symbols

Cites Work

• Unnamed Item
• Thue choosability of trees
• Last cases of Dejean's conjecture
• Nonrepetitive colorings of graphs -- a survey
• Substitution dynamical systems - spectral analysis
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• The Thue-Morse word contains circular \(5/2^+\) power free words of every length
• Repetition threshold for circular words
• Acyclic edge-coloring using entropy compression
• On Dejean's conjecture over large alphabets
• Attainable lengths for circular binary words avoiding \(k\) powers
• Sur un théorème de Thue
• ON THE EXISTENCE OF MINIMAL β-POWERS
• Nonrepetitive list colourings of paths
• A proof of Dejean’s conjecture
• Nonrepetitive colorings of graphs
• Nonrepetitive Choice Number of Trees

This page was built for publication: \((2+\epsilon )\)-nonrepetitive list colouring of paths