Pages that link to "Item:Q1028809"
From MaRDI portal
The following pages link to Non-repetitive 3-coloring of subdivided graphs (Q1028809):
Displaying 12 items.
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Nonrepetitive colorings of trees (Q864157) (← 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)
- 3-colourability and forbidden subgraphs (Q2816134) (← links)
- Repetition thresholds for subdivided graphs and trees (Q2911431) (← links)
- Facial non-repetitive edge-coloring of plane graphs (Q3067060) (← links)
- Nonrepetitive list colourings of paths (Q3068765) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs (Q5264756) (← links)