Improved lower bound for the list chromatic number of graphs with no Kt minor
From MaRDI portal
Publication:5886353
Recommendations
Cites work
- A relaxed Hadwiger's conjecture for list colorings
- An extremal function for contractions of graphs
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs
- Choosability of K₅-minor-free graphs
- Connectivity and choosability of graphs with no \(K_t\) minor
- Contractibility and the Hadwiger conjecture
- Disproof of the list Hadwiger conjecture
- Every planar graph is 5-choosable
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Hadwiger's conjecture
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- List colourings of planar graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Progress towards Nash-Williams' conjecture on triangle decompositions
Cited in
(13)- Connectivity and choosability of graphs with no \(K_t\) minor
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
- Breaking the degeneracy barrier for coloring graphs with no K_t minor
- Disproof of the group coloring version of the Hadwiger conjecture
- Subgraphs of large connectivity and chromatic number
- Local Hadwiger's conjecture
- Refined List Version of Hadwiger’s Conjecture
- Improved lower bound for the list chromatic number of graphs with no K_t minor
- On the choosability of \(H\)-minor-free graphs
- Disproof of the list Hadwiger conjecture
- Dominating K_t-models
- Limits of degeneracy for colouring graphs with forbidden minors
- A relaxed Hadwiger's conjecture for list colorings
This page was built for publication: Improved lower bound for the list chromatic number of graphs with no Kt minor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886353)
