Hadwiger's conjecture is decidable

DOI10.1145/1536414.1536476zbMath1304.05047OpenAlexW2003904409MaRDI QIDQ5172739

Ken-ichi Kawarabayashi, Bruce A. Reed

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1536414.1536476

zbMATH Keywords

four-color theoremHadwiger's conjecture

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Graph Minors and Parameterized Algorithm Design ⋮ Combing a Linkage in an Annulus ⋮ Faster parameterized algorithms for minor containment ⋮ Fast minor testing in planar graphs ⋮ Finite dualities and map-critical graphs on a fixed surface ⋮ Subdivisions ofK₅in Graphs Embedded on Surfaces With Face-Width at Least 5 ⋮ Additive non-approximability of chromatic number in proper minor-closed classes ⋮ Unnamed Item

This page was built for publication: Hadwiger's conjecture is decidable