Note on coloring graphs without odd-\(K_k\)-minors
From MaRDI portal
Publication:1026013
DOI10.1016/j.jctb.2008.12.001zbMath1198.05058OpenAlexW1572447597MaRDI QIDQ1026013
Publication date: 23 June 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2008.12.001
Related Items (7)
Improved bound for improper colourings of graphs with no odd clique minor ⋮ Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant ⋮ A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor ⋮ Tight bounds for divisible subdivisions ⋮ Odd complete minors in even embeddings on surfaces ⋮ Fractional coloring and the odd Hadwiger's conjecture ⋮ Hadwiger’s Conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bound of the Hadwiger number of graphs by their average degree
- Packing non-zero \(A\)-paths in group-labelled graphs
- Some remarks on the odd Hadwiger's conjecture
- Linear connectivity forces large complete bipartite minors
- 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
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- The extremal function for complete minors
- Rooted minor problems in highly connected graphs
- Graph minors. XIII: The disjoint paths problem
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- On the odd-minor variant of Hadwiger's conjecture
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
- An extremal function for contractions of graphs
- A Weakening of the Odd Hadwiger's Conjecture
This page was built for publication: Note on coloring graphs without odd-\(K_k\)-minors
