35 citations · 94 across the 13 of their papers we have counts for
1 paper · 2 filters
János Barát, Gwenaël Joret, David R. Wood
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is t-choosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4t-…