Vertex-bipartition method for colouring minor-closed classes of graphs
Thomas conjectured that there is an absolute constant c such that for every proper minor-closed class of graphs, there is a polynomial-time algorithm that can colour every G ∈ C with at most χ (G) + c colours. We introduce a parameter , called the degenerate value of C, which is defined to be the smallest r such that every G ∈ can be vertex-bipartitioned into a part of bounded tree-width (the bound depending only on ), and a part that is r-degenerate. Although the existence of one global bound for the degenerate values of all proper minor-closed classes would imply Thomas's conjecture, we prove that the values can be made arbitrarily large. The problem lies in the clique sum operation. As our main result, we show that excluding a planar graph with a fixed number of apex vertices gives rise to a minor-closed class with small degenerate value. As corollaries, we obtain that (i) the degenerate value of every class of graphs of bounded local tree-width is at most 6, and (ii) the degenerate value of the class of Kn-minor-free graphs is at most n + 1. These results give rise to P-time approximation algorithms for colouring any graph in these classes within an error of at most 7 and n + 2 of its chromatic number, respectively. Copyright © 2010 Cambridge University Press.
Publication Source (Journal or Book title)
Combinatorics Probability and Computing
Ding, G., & Dziobiak, S. (2010). Vertex-bipartition method for colouring minor-closed classes of graphs. Combinatorics Probability and Computing, 19 (4), 579-591. https://doi.org/10.1017/S0963548310000076