We show that anagram-free vertex colouring a 2 × n square grid requires a number of colours that increases with n. This answers an open question in Wilson’s thesis and shows that that are even graphs of pathwidth 2 that do not have anagram-free colourings with a bounded number of colours.
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics