A Weakening of the Odd Hadwiger's Conjecture
From MaRDI portal
Publication:3608337
DOI10.1017/S0963548308009462zbMATH Open1188.05062WikidataQ123019306 ScholiaQ123019306MaRDI QIDQ3608337FDOQ3608337
Publication date: 4 March 2009
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
- Some remarks on the odd Hadwiger's conjecture
- Strengthening Hadwiger's Conjecture
- scientific article
- On the odd-minor variant of Hadwiger's conjecture
- On the Hadwiger's conjecture
- A weaker form of Ulam's conjecture
- Partial result on Hadwiger's conjecture
- A special case of Hadwiger's conjecture
- scientific article; zbMATH DE number 7651162
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
Cites Work
- A bound on the chromatic number of a graph
- The extremal function for complete minors
- Über eine Eigenschaft der ebenen Komplexe
- Lower bound of the Hadwiger number of graphs by their average degree
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- A relaxed Hadwiger's conjecture for list colorings
- Some remarks on the odd Hadwiger's conjecture
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
Cited In (15)
- Title not available (Why is that?)
- Improved bound for improper colourings of graphs with no odd clique minor
- Clustered colouring of graph classes with bounded treedepth or pathwidth
- Contractibility and the Hadwiger conjecture
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
- A relaxed Hadwiger's conjecture for list colorings
- Hadwiger’s Conjecture
- Clustered coloring of graphs with bounded layered treewidth and bounded degree
- Weak form of Holzapfel's conjecture
- On the odd-minor variant of Hadwiger's conjecture
- Fractional coloring and the odd Hadwiger's conjecture
- Improper colouring of graphs with no odd clique minor
- On topological relaxations of chromatic conjectures
- Clustered variants of Hajós' conjecture
- Note on coloring graphs without odd-\(K_k\)-minors
This page was built for publication: A Weakening of the Odd Hadwiger's Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608337)