@inproceedings{1b5caa50bdab4c91a4e289cb2f8cb2bd,
title = "Anagram-free chromatic number is not pathwidth-bounded",
abstract = "The anagram-free chromatic number is a new graph parameter introduced independently by Kam{\v c}ev, {\L}uczak, and Sudakov [1] and Wilson and Wood [5]. In this note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2n-vertex planar graphs of pathwidth 3 with anagram-free chromatic number Ω(log n). We also describe kn vertex graphs with pathwidth 2 k- 1 having anagram-free chromatic number in Ω(klog n).",
author = "Paz Carmi and Vida Dujmovi{\'c} and Pat Morin",
note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018 ; Conference date: 27-06-2018 Through 29-06-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-030-00256-5\_8",
language = "English",
isbn = "9783030002558",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "91--99",
editor = "Andreas Brandst{\"a}dt and Ekkehard K{\"o}hler and Klaus Meer",
booktitle = "Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Proceedings",
address = "Germany",
}