Pages that link to "Item:Q941387"
From MaRDI portal
The following pages link to Nonrepetitive colorings of graphs of bounded tree-width (Q941387):
Displayed 19 items.
- Thue choosability of trees (Q411845) (← links)
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← 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)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← 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)
- Facial Nonrepetitive Vertex Coloring of Plane Graphs (Q2852615) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)