The following pages link to (Q3424780):
Displaying 12 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Nonrepetitive colorings of trees (Q864157) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- The complexity of nonrepetitive coloring (Q1003751) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Nonrepetitive colorings of graphs (Q5899395) (← links)