The following pages link to Anagram-Free Colourings of Graphs (Q3177364):
Displaying 5 items.
- On alternating anagrams (Q1969780) (← links)
- \(2\times n\) grids have unbounded anagram-free chromatic number (Q2170797) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- The Zero Forcing Number of Graphs (Q4610449) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
