The following pages link to Thue choosability of trees (Q411845):
Displaying 13 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
- Every plane graph is facially-non-repetitively \(C\)-choosable (Q1753049) (← links)
- A note about online nonrepetitive coloring \(k\)-trees (Q2197409) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- New bounds for facial nonrepetitive colouring (Q2409520) (← links)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Nonrepetitive list colourings of paths (Q3068765) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)
