Pages that link to "Item:Q504976"
From MaRDI portal
The following pages link to Pathwidth and nonrepetitive list coloring (Q504976):
Displaying 9 items.
- Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Every plane graph is facially-non-repetitively \(C\)-choosable (Q1753049) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- A note about online nonrepetitive coloring \(k\)-trees (Q2197409) (← links)
- New bounds for facial nonrepetitive colouring (Q2409520) (← links)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- Nonrepetitive list colourings of paths (Q3068765) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)