Pages that link to "Item:Q3068765"
From MaRDI portal
The following pages link to Nonrepetitive list colourings of paths (Q3068765):
Displayed 16 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Thue choosability of trees (Q411845) (← links)
- On the facial Thue choice index of plane graphs (Q418875) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- The local cut lemma (Q2357223) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)