Pages that link to "Item:Q925326"
From MaRDI portal
The following pages link to Nonrepetitive colorings of graphs -- a survey (Q925326):
Displaying 28 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Thue choosability of trees (Q411845) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Nonrepetitive vertex colorings of graphs (Q658062) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Fractional Thue chromatic number of graphs (Q906448) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- Anagram-free colorings of graphs (Q1689991) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- A note about online nonrepetitive coloring \(k\)-trees (Q2197409) (← 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)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
- Repetition thresholds for subdivided graphs and trees (Q2911431) (← links)
- On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)
- Nonrepetitive list colourings of paths (Q3068765) (← links)
- Anagram-Free Colourings of Graphs (Q3177364) (← links)
- Splitting necklaces and measurable colorings of the real line (Q3625532) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
