Pages that link to "Item:Q1003751"
From MaRDI portal
The following pages link to The complexity of nonrepetitive coloring (Q1003751):
Displaying 4 items.
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
