Pages that link to "Item:Q1010826"
From MaRDI portal
The following pages link to Notes on nonrepetitive graph colouring (Q1010826):
Displaying 15 items.
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- The complexity of nonrepetitive coloring (Q1003751) (← links)
- On tree-partition-width (Q1024321) (← links)
- A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← 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)
- (Q3424780) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- Tree-partitions with bounded degree trees (Q6630448) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
- On nonrepetitive colorings of paths and cycles (Q6648264) (← links)