Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs
From MaRDI portal
Publication:6144390
DOI10.1016/j.jctb.2023.08.009arXiv2209.00594OpenAlexW4386691333MaRDI QIDQ6144390
Anders Martinsson, Raphael Steiner
Publication date: 29 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.00594
Cites Work
- Unnamed Item
- Rooted grid minors
- Rooted \(K_4\)-minors
- 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
- Rooted complete minors in line graphs with a Kempe coloring
- Rooted topological minors on four vertices
- Über eine Eigenschaft der ebenen Komplexe
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- Hadwiger’s Conjecture
- Thomassen's Choosability Argument Revisited
- Extremal functions for rooted minors
- Strengthening Hadwiger's Conjecture
- Four terminal planar Delta-Wye reducibility via rooted K2,4 minors
- Graph Minors and Reliable Single Message Transmission
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
This page was built for publication: Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs