Pages that link to "Item:Q1856341"
From MaRDI portal
The following pages link to There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 (Q1856341):
Displaying 34 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)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Nonrepetitive vertex colorings of graphs (Q658062) (← links)
- Cyclically repetition-free words on small alphabets (Q765486) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Nonrepetitive colorings of trees (Q864157) (← links)
- Some results in square-free and strong square-free edge-colorings of graphs (Q879399) (← links)
- Fractional Thue chromatic number of graphs (Q906448) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Border correlations of partial words (Q987385) (← links)
- On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- The Thue-Morse word contains circular \(5/2^+\) power free words of every length (Q1770411) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- Facial anagram-free edge-coloring of plane graphs (Q2399301) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- New bounds for facial nonrepetitive colouring (Q2409520) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
- Facial nonrepetitive vertex coloring of plane graphs (Q2852615) (← links)
- On the existence of minimal \(\beta\)-powers (Q2909104) (← links)
- Facial non-repetitive edge-coloring of plane graphs (Q3067060) (← links)
- Nonrepetitive list colourings of paths (Q3068765) (← links)
- Lengths of extremal square-free ternary words. (Q4986268) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- Nonrepetitive colorings of graphs (Q5899395) (← links)
- On nonrepetitive colorings of paths and cycles (Q6648264) (← links)
