Anagram-free chromatic number is not pathwidth-bounded

Paz Carmi, Vida Dujmović, Pat Morin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


The anagram-free chromatic number is a new graph parameter introduced independently by Kamčev, Ł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).

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Proceedings
EditorsAndreas Brandstädt, Ekkehard Köhler, Klaus Meer
PublisherSpringer Verlag
Number of pages9
ISBN (Print)9783030002558
StatePublished - 1 Jan 2018
Event44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018 - Cottbus, Germany
Duration: 27 Jun 201829 Jun 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11159 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Anagram-free chromatic number is not pathwidth-bounded'. Together they form a unique fingerprint.

Cite this