Skip to content

Opening book details…

Can I read $2\times n$ Grids have Unbounded Anagram-Free Chromatic Number on EtoBox?

$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number by Bazarghani, Saman; Carmi, Paz; Dujmović, Vida; Morin, Pat is a scholarly article available to read on EtoBox.

What is $2\times n$ Grids have Unbounded Anagram-Free Chromatic Number about?

We show that anagram-free vertex colouring a $2\times n$ square grid requires a number of colours that increases with $n$. This answers an open question in Wilson's thesis and shows that even graphs of pathwidth $2$ do not have anagram-free colourings with a bounded number of colours.

Author
Bazarghani, Saman; Carmi, Paz; Dujmović, Vida; Morin, Pat
Published
2021
Language
EN

More by Bazarghani, Saman; Carmi, Paz; Dujmović, Vida; Morin, Pat

Browse all works by Bazarghani, Saman; Carmi, Paz; Dujmović, Vida; Morin, Pat