Pages that link to "Item:Q658062"
From MaRDI portal
The following pages link to Nonrepetitive vertex colorings of graphs (Q658062):
Displayed 17 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Fractional Thue chromatic number of graphs (Q906448) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← 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)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
- Facial Nonrepetitive Vertex Coloring of Plane Graphs (Q2852615) (← links)
- On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)