Anagram-Free Chromatic Number is not Pathwidth-Bounded
From MaRDI portal
Publication:6297352
DOI10.1007/978-3-030-00256-5_8zbMath1519.05069arXiv1802.01646MaRDI QIDQ6297352
Paz Carmi, Pat Morin, Vida Dujmović
Publication date: 5 February 2018
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Anagram-Free Chromatic Number is not Pathwidth-Bounded