The following pages link to Nonrepetitive graph colouring (Q2122918):
Displaying 17 items.
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Non-repetitive 3-coloring of subdivided graphs (Q1028809) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Nonrepetitive list colourings of paths (Q3068765) (← links)
- (Q3424780) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- Nonrepetitive colorings of graphs (Q5899395) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- The product structure of squaregraphs (Q6143380) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Strongly proper connected coloring of graphs (Q6621951) (← links)
- On nonrepetitive colorings of paths and cycles (Q6648264) (← links)