{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:50Z","timestamp":1753893830844,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>\u00a0We 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 there are even graphs of pathwidth $2$ that do not have anagram-free colourings with a bounded number of colours.<\/jats:p>","DOI":"10.37236\/10411","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T07:52:19Z","timestamp":1662623539000},"source":"Crossref","is-referenced-by-count":0,"title":["$2\\times n$ Grids have Unbounded Anagram-Free Chromatic Number"],"prefix":"10.37236","volume":"29","author":[{"given":"Saman","family":"Bazarghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2022,8,26]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i3p43\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i3p43\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T07:52:26Z","timestamp":1662623546000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i3p43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,26]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,7,1]]}},"URL":"https:\/\/doi.org\/10.37236\/10411","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2022,8,26]]},"article-number":"P3.43"}}