Notes on tree- and path-chromatic number

DOI10.1007/978-3-030-62497-2_30zbMath1481.05048arXiv2002.05363OpenAlexW3006017127MaRDI QIDQ2058953

David R. Wood, Liana Yepremyan, Tony Huynh, Bruce A. Reed

Publication date: 10 December 2021

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

zbMATH Keywords

Hadwiger's conjecture\(k\)-colourable graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Induced subgraphs of graphs with large chromatic number. III: Long holes
• Tree-chromatic number
• A Ramsey theorem for trees
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Separating tree-chromatic number from path-chromatic number
• Layered separators in minor-closed graph classes with applications
• Über eine Eigenschaft der ebenen Komplexe
• Hadwiger’s Conjecture
• Graph Theory and Probability
• Set Partitioning via Inclusion-Exclusion
• Computing Pathwidth Faster Than 2 n
• On the hardness of approximating minimization problems
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number^*
• Sur le coloriage des graphs
• On the hardness of approximating the chromatic number

This page was built for publication: Notes on tree- and path-chromatic number