Lower bound of the hadwiger number of graphs by their average degree

1984/12/01 by Alexandr Kostochka, A. V. Kostochka · 13 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Conjecture #Degree (music) #Discrete mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Mathematics #Upper and lower bounds

paper · doi:10.1007/bf02579141

crossref issued 1984/12/01 · crossref published 1984/12/01 · crossref published-print 1984/12/01 · openalex publication_date 1984/12/01 · crossref created 2007/03/22 · crossref deposited 2019/05/18 · openalex created_date 2025/10/10 · crossref indexed 2026/07/17 · openalex updated_date 2026/07/29

Cited by

• Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
• The Extremal Function for Complete Minors
• The Graph Minor Algorithm with Parity Conditions
• On the odd-minor variant of Hadwiger's conjecture
• Note on coloring graphs without odd-Kk-minors
• Rank-width and tree-width of H-minor-free graphs
• Finding Large Clique Minors is Hard
• Approximating the maximum clique minor and some subgraph homeomorphism problems
• Disproof of the List Hadwiger Conjecture
• All maximal independent sets and dynamic dominance for sparse graphs
• Graph minor [wikipedia]
• Hadwiger conjecture (graph theory) [wikipedia]
• Hadwiger number [wikipedia]