Anagram-free chromatic number is not pathwidth-bounded

DOI10.1007/978-3-030-00256-5_8OpenAlexW2963875102MaRDI QIDQ1627156

Paz Carmi, Vida Dujmović, Pat Morin

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1802.01646

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

\(2\times n\) grids have unbounded anagram-free chromatic number

This page was built for publication: Anagram-free chromatic number is not pathwidth-bounded