2 × n grids have unbounded anagram-free chromatic number

Saman Bazargani, Paz Carmi, Vida Dujmović, Pat Morin

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number3.43
JournalElectronic Journal of Combinatorics
Issue number3
StatePublished - 1 Jan 2022

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of '2 × n grids have unbounded anagram-free chromatic number'. Together they form a unique fingerprint.

Cite this