Pages that link to "Item:Q4909201"
From MaRDI portal
The following pages link to New approach to nonrepetitive sequences (Q4909201):
Displaying 34 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- A note on Thue games (Q344549) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- Every plane graph is facially-non-repetitively \(C\)-choosable (Q1753049) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- Entropy compression versus Lovász local lemma (Q2020021) (← links)
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Fractional meanings of nonrepetitiveness (Q2120819) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- How to play Thue games (Q2342675) (← links)
- The local cut lemma (Q2357223) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- New bounds for facial nonrepetitive colouring (Q2409520) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Pattern avoidance in partial words over a ternary alphabet (Q2517160) (← links)
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
- On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)
- A short proof that shuffle squares are 7-avoidable (Q3186679) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- How far away must forced letters be so that squares are still avoidable? (Q5118863) (← links)
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
- Extensions and reductions of squarefree words (Q6177427) (← links)
- Edge colorings avoiding patterns (Q6181991) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters (Q6201902) (← links)
