A Weakening of the Odd Hadwiger's Conjecture
From MaRDI portal
Publication:3608337
DOI10.1017/S0963548308009462zbMath1188.05062WikidataQ123019306 ScholiaQ123019306MaRDI QIDQ3608337
Publication date: 4 March 2009
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items
Improper colouring of graphs with no odd clique minor, Clustered colouring of graph classes with bounded treedepth or pathwidth, Improved bound for improper colourings of graphs with no odd clique minor, Contractibility and the Hadwiger conjecture, On topological relaxations of chromatic conjectures, Note on coloring graphs without odd-\(K_k\)-minors, Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant, Clustered variants of Hajós' conjecture, Hadwiger’s Conjecture
Cites Work
- Lower bound of the Hadwiger number of graphs by their average degree
- A relaxed Hadwiger's conjecture for list colorings
- Some remarks on the odd Hadwiger's conjecture
- A bound on the chromatic number of a graph
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- The extremal function for complete minors
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Über eine Eigenschaft der ebenen Komplexe
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs