Pages that link to "Item:Q524188"
From MaRDI portal
The following pages link to Nonrepetitive colouring via entropy compression (Q524188):
Displayed 14 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Fractional Thue chromatic number of graphs (Q906448) (← links)
- Total Thue colourings of graphs (Q2340970) (← 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)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Facial Nonrepetitive Vertex Coloring of Plane Graphs (Q2852615) (← links)
- On the Facial Thue Choice Index via Entropy Compression (Q2930037) (← links)