Pages that link to "Item:Q1028458"
From MaRDI portal
The following pages link to List-coloring graphs without \(K_{4,k}\)-minors (Q1028458):
Displaying 6 items.
- Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
- On group choosability of graphs. II (Q2014707) (← 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)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- On the choosability of \(H\)-minor-free graphs (Q6632798) (← links)