On the odd-minor variant of Hadwiger's conjecture

2008/05/10 by Jim Geelen, Bert Gerards, Bruce Reed +2 · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Conjecture #Discrete mathematics #Disjoint sets #Graph #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Mathematics #Vertex (graph theory)

paper · pdf · doi:10.1016/j.jctb.2008.03.006

openalex publication_date 2008/05/10 · crossref created 2008/05/10 · crossref issued 2009/01/01 · crossref published 2009/01/01 · crossref published-print 2009/01/01 · crossref deposited 2019/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01 · crossref indexed 2026/08/05

Citations

• Every planar map is four colorable. Part I: Discharging
• Graph decomposition with applications to subdivisions and path systems modulo k
• Lower bound of the hadwiger number of graphs by their average degree
• Über eine Eigenschaft der ebenen Komplexe
• An extremal function for contractions of graphs

Cited by

• Note on coloring graphs without odd-Kk-minors
• Graph minor [wikipedia]
• Hadwiger conjecture (graph theory) [wikipedia]