The following pages link to Nonrepetitive colorings of graphs (Q5899395):
Displaying 10 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- On the facial Thue choice index of plane graphs (Q418875) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← 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)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- How far away must forced letters be so that squares are still avoidable? (Q5118863) (← links)
