Some remarks on the odd Hadwiger's conjecture
From MaRDI portal
Publication:950324
DOI10.1007/S00493-007-2213-9zbMATH Open1164.05025OpenAlexW2059021689WikidataQ123243143 ScholiaQ123243143MaRDI QIDQ950324FDOQ950324
Z. X. Song, Ken-ichi Kawarabayashi
Publication date: 22 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-2213-9
Cites Work
- A bound on the chromatic number of a graph
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The extremal function for complete minors
- Title not available (Why is that?)
- An extremal function for contractions of graphs
- On a special case of Hadwiger's conjecture
- Lower bound of the Hadwiger number of graphs by their average degree
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- On the odd-minor variant of Hadwiger's conjecture
- Title not available (Why is that?)
- On Hadwiger's Number and the Stability Number
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Linear connectivity forces large complete bipartite minors
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Independence number and clique minors
- Fractional colouring and Hadwiger's conjecture
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Subcontraction-equivalence and Hadwiger's conjecture
Cited In (12)
- Improved bound for improper colourings of graphs with no odd clique minor
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
- Title not available (Why is that?)
- A Weakening of the Odd Hadwiger's Conjecture
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
- Hadwiger’s Conjecture
- Tight bounds for divisible subdivisions
- On the odd-minor variant of Hadwiger's conjecture
- Fractional coloring and the odd Hadwiger's conjecture
- On topological relaxations of chromatic conjectures
- Note on coloring graphs without odd-\(K_k\)-minors
- Hadwiger's Conjecture for Graphs with Forbidden Holes
Recommendations
- A Weakening of the Odd Hadwiger's Conjecture 👍 👎
- Fractional coloring and the odd Hadwiger's conjecture 👍 👎
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant 👍 👎
- Improper colouring of graphs with no odd clique minor 👍 👎
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor 👍 👎
This page was built for publication: Some remarks on the odd Hadwiger's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950324)
