Pages that link to "Item:Q941381"

The following pages link to Thue type problems for graphs, points, and numbers (Q941381):

Displaying 36 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)
• Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
• Nonrepetitive colorings of line arrangements (Q499479) (← links)
• Nonrepetitive colouring via entropy compression (Q524188) (← links)
• Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
• Grasshopper avoidance of patterns (Q727190) (← links)
• Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
• The complexity of nonrepetitive coloring (Q1003751) (← links)
• A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
• String powers in trees (Q1679231) (← links)
• On avoding \(r\)-repetitions in \(\mathbb R^2\) (Q1689937) (← links)
• Nonrepetitive list colorings of the integers (Q2033476) (← links)
• Repetitions in Toeplitz words and the Thue threshold (Q2106611) (← links)
• Fractional meanings of nonrepetitiveness (Q2120819) (← links)
• From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
• Extremal square-free words (Q2309218) (← links)
• Total Thue colourings of graphs (Q2340970) (← links)
• Permutations destroying arithmetic structure (Q2341051) (← links)
• How to play Thue games (Q2342675) (← links)
• Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
• Words avoiding repetitions in arithmetic progressions (Q2474231) (← links)
• On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)
• String Powers in Trees (Q2942264) (← links)
• Facial non-repetitive edge-coloring of plane graphs (Q3067060) (← links)
• Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
• Nonrepetitive list colourings of paths (Q3068765) (← links)
• Anagram-Free Colourings of Graphs (Q3177364) (← links)
• Avoiding Three Consecutive Blocks of the Same Size and Same Sum (Q3189645) (← links)
• Splitting necklaces and measurable colorings of the real line (Q3625532) (← links)
• New approach to nonrepetitive sequences (Q4909201) (← links)
• Avoiding Multiple Repetitions in Euclidean Spaces (Q5208643) (← links)
• Nonrepetitive colorings of graphs (Q5899395) (← links)
• Nonrepetitive and pattern-free colorings of the plane (Q5964253) (← links)
• Extensions and reductions of squarefree words (Q6177427) (← links)