Pages that link to "Item:Q2099418"
From MaRDI portal
The following pages link to Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418):
Displayed 7 items.
- 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)
- Improved bound for improper colourings of graphs with no odd clique minor (Q5885199) (← links)
- Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor (Q5886353) (← links)
- Local Hadwiger's conjecture (Q6170795) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- Packing list‐colorings (Q6185050) (← links)