Hadwiger's conjecture

From MaRDI portal





Hadwiger's conjecture, which is one of the most substantial open problems in graph theory, asserts that every non-\(k\)-colorable graph contains the complete graph \(K_k\) as a minor. The conjecture is known to be true for \(k\leq 6\) and open for the remaining values of \(k\). The author surveys known results on the conjecture and its variants.NEWLINENEWLINEFor the entire collection see [Zbl 1317.05004].




Cited in
(43)








This page was built for publication: Hadwiger's conjecture

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