The following pages link to Anagram-free graph colouring (Q1753108):
Displaying 6 items.
- Anagram-free chromatic number is not pathwidth-bounded (Q1627156) (← links)
- Anagram-free colorings of graphs (Q1689991) (← links)
- \(2\times n\) grids have unbounded anagram-free chromatic number (Q2170797) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- Facial anagram-free edge-coloring of plane graphs (Q2399301) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)