Thue choosability of trees
From MaRDI portal
Publication:411845
DOI10.1016/j.dam.2011.07.017zbMath1239.05064OpenAlexW1999574685MaRDI QIDQ411845
Pascal Ochem, Xuding Zhu, Francesca Fiorenzi, Patrice Ossona de Mendez
Publication date: 30 April 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.017
Related Items (13)
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 ⋮ New bounds for facial nonrepetitive colouring ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ On low tree-depth decompositions ⋮ A note about online nonrepetitive coloring \(k\)-trees ⋮ Pathwidth and nonrepetitive list coloring ⋮ New approach to nonrepetitive sequences ⋮ Every plane graph is facially-non-repetitively \(C\)-choosable ⋮ Nonrepetitive colouring via entropy compression ⋮ Nonrepetitive list colourings of paths ⋮ On a generalization of Thue sequences
Cites Work
- Unnamed Item
- Pattern avoidance: themes and variations
- Nonrepetitive colorings of graphs -- a survey
- Thue type problems for graphs, points, and numbers
- Nonrepetitive colorings of graphs of bounded tree-width
- Avoidable patterns in strings of symbols
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Tree-depth, subgraph coloring and homomorphism bounds
- Nonrepetitive list colourings of paths
- Automatic Sequences
- Nonrepetitive colorings of graphs
This page was built for publication: Thue choosability of trees