Improper colouring of graphs with no odd clique minor

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 223
  • Download : 0
As a strengthening of Hadwigers conjecture, Gerards and Seymour conjectured that every graph with no odd Kt minor is (t - 1)-colourable. We prove two weaker variants of this conjecture. Firstly, we show that for each t (3) 2, every graph with no odd Kt minor has a partition of its vertex set into 6t - 9 sets V-1, ..., V6t-9 such that each Vi induces a subgraph of bounded maximum degree. Secondly, we prove that for each t ? 2, every graph with no odd Kt minor has a partition of its vertex set into 10t -13 sets V-1,..., V10t -13 such that each Vi induces a subgraph with components of bounded size. The second theorem improves a result of Kawarabayashi (2008), which states that the vertex set can be partitioned into 496t such sets.
Publisher
CAMBRIDGE UNIV PRESS
Issue Date
2019-09
Language
English
Article Type
Article
Citation

COMBINATORICS PROBABILITY & COMPUTING, v.28, no.5, pp.740 - 754

ISSN
0963-5483
DOI
10.1017/S0963548318000548
URI
http://hdl.handle.net/10203/269821
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0