The following pages link to Nonrepetitive colorings of graphs (Q4798171):
Displaying 50 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Thue choosability of trees (Q411845) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Nonrepetitive vertex colorings of graphs (Q658062) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Nonrepetitive colorings of trees (Q864157) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Some results in square-free and strong square-free edge-colorings of graphs (Q879399) (← links)
- Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence (Q888175) (← 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)
- Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
- The complexity of nonrepetitive coloring (Q1003751) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- Optimal strong parity edge-coloring of complete graphs (Q1046737) (← links)
- A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
- Anagram-free colorings of graphs (Q1689991) (← links)
- Uniformly recurrent subgroups and simple \(C^{\ast}\)-algebras (Q1694692) (← links)
- Realization of aperiodic subshifts and uniform densities in groups (Q1733162) (← links)
- Every plane graph is facially-non-repetitively \(C\)-choosable (Q1753049) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
- A note about online nonrepetitive coloring \(k\)-trees (Q2197409) (← links)
- Building large free subshifts using the Local Lemma (Q2286357) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Negative curvature in graphical small cancellation groups (Q2319843) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Small cancellation theory over Burnside groups (Q2319887) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- How to play Thue games (Q2342675) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- The local cut lemma (Q2357223) (← links)
- Facial anagram-free edge-coloring of plane graphs (Q2399301) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- New bounds for facial nonrepetitive colouring (Q2409520) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
