Anagram-free chromatic number is not pathwidth-bounded

DOI10.1007/978-3-030-00256-5_8MaRDI QIDQ1627156zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Anagram-free graph colouring
• Anagram-free colourings of graphs
• Anagram-free colorings of graphs
• 2 n grids have unbounded anagram-free chromatic number
• Anagram-Free Colorings of Graph Subdivisions

Cited in

(3)

• Anagram-free graph colouring
• 2 n grids have unbounded anagram-free chromatic number
• Anagram-Free Chromatic Number is not Pathwidth-Bounded

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1627156)