The following pages link to (Q4412125):
Displaying 12 items.
- Pattern avoidance: themes and variations (Q557911) (← links)
- Languages generated by iterated idempotency (Q868949) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- On periodic properties of circular words (Q897316) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Non-repetitive colorings of infinite sets (Q1874373) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 (Q2216428) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- Counting subwords in circular words and their Parikh matrices (Q6185846) (← links)