Note: Note on coloring graphs without odd-Kk-minors

Authors:
Ken-ichi Kawarabayashi
Affiliations:
National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
Venue:
Journal of Combinatorial Theory Series B
Year:
2009

Citing 10
Cited 5

Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
The extremal function for complete minors

Journal of Combinatorial Theory Series B
Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A Minor

Combinatorica
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Packing Non-Zero A-Paths In Group-Labelled Graphs

Combinatorica
Some remarks on the odd hadwiger’s conjecture

Combinatorica
On the odd-minor variant of Hadwiger's conjecture

Journal of Combinatorial Theory Series B
A weakening of the odd hadwiger's conjecture

Combinatorics, Probability and Computing
Linear connectivity forces large complete bipartite minors

Journal of Combinatorial Theory Series B

A nearly linear time algorithm for the half integral parity disjoint paths packing problem

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A weakening of the odd hadwiger's conjecture

Combinatorics, Probability and Computing
Odd cycle packing

Proceedings of the forty-second ACM symposium on Theory of computing
Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a short proof that every graph G without an odd K"k-minor is O(klogk)-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.