A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
From MaRDI portal
Publication:2151177
DOI10.1007/s00493-021-4390-3OpenAlexW3198820907WikidataQ114229219 ScholiaQ114229219MaRDI QIDQ2151177
Publication date: 30 June 2022
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.07647
Related Items
Improved bound for improper colourings of graphs with no odd clique minor ⋮ Connectivity and choosability of graphs with no \(K_t\) minor
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
- Highly parity linked graphs
- Note on coloring graphs without odd-\(K_k\)-minors
- A bound on the chromatic number of a graph
- An improved linear edge bound for graph linkages
- The extremal function for complete minors
- On some extremal problems in graph theory
- On the odd-minor variant of Hadwiger's conjecture
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Highly linked graphs
- Hadwiger’s Conjecture
- An extremal function for contractions of graphs
This page was built for publication: A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor