Pages that link to "Item:Q5886353"
From MaRDI portal
The following pages link to Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor (Q5886353):
Displaying 9 items.
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs (Q2153396) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Disproof of the group coloring version of the Hadwiger conjecture (Q2920883) (← links)
- Subgraphs of large connectivity and chromatic number (Q6133373) (← links)
- Local Hadwiger's conjecture (Q6170795) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- On the choosability of \(H\)-minor-free graphs (Q6632798) (← links)
