| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657097 | Journal of Combinatorial Theory, Series B | 2009 | 4 Pages |
Abstract
We give a short proof that every graph G without an odd Kk-minor is -colorable. This was first proved by Geelen et al. [J. Geelen, B. Gerards, B. Reed, P. Seymour, A. Vetta, On the odd-minor variant of Hadwiger's conjecture, J. Combin. Theory Ser. B 99 (1) (2009) 20–29]. We give a considerably simpler and shorter proof following their approach.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
