Hostname: page-component-7479d7b7d-jwnkl Total loading time: 0 Render date: 2024-07-13T16:57:02.295Z Has data issue: false hasContentIssue false
  • English
  • Français

Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs

Published online by Cambridge University Press:  21 April 2010

GUOLI DING  and
STAN DZIOBIAK
GUOLI DING
Affiliation:
Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, LA 70803-4918, USA (e-mail: standzio@math.lsu.edu, ding@math.lsu.edu)
STAN DZIOBIAK
Affiliation:
Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, LA 70803-4918, USA (e-mail: standzio@math.lsu.edu, ding@math.lsu.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

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 ∈ with at most χ(G) + c colours. We introduce a parameter ρ(), called the degenerate value of , 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.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 19 , Issue 4 , July 2010 , pp. 579 - 591
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Arnborg, S. and Proskurowski, A. (1989) Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23 11–24.Google Scholar
[2]Bodlaender, H. L. (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 1305–1317.CrossRefGoogle Scholar
[3]Demaine, E. and Hajiaghayi, M. T. (2004) Diameter and treewidth in minor-closed graph families, revisited. Algorithmica 40 211–215.Google Scholar
[4]Demaine, E. and Hajiaghayi, M. T. (2009) Approximation algorithms via structural results for apex-minor-free graphs. Proceedings of ICALP 2009, Part I. Lecture Notes in Computer Science 5555, Springer, pp. 316–327.Google Scholar
[5]DeVos, M., Ding, G., Oporowski, B., Sanders, D., Reed, B., Seymour, P. and Vertigan, D. (2004) Excluding any graph as a minor allows a low tree-width 2-coloring. J. Combin. Theory Ser. B 94 25–41.Google Scholar
[6]Diestel, R. (2000) Graph Theory, 2nd edn, Springer.Google Scholar
[7]Feige, U. and Kilian, J. (1996) Zero knowledge and the chromatic number. In Proc. 11th Annual IEEE Conference on Computational Complexity, IEEE Computer Society, pp. 278–287.Google Scholar
[8]Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman.Google Scholar
[9]Graham, R. L., Rothschild, B. L. and Spencer, J. H. (1990) Ramsey Theory, 2nd edn, Wiley.Google Scholar
[10]Mader, W. (1967) Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174 265–268.Google Scholar
[11]Mohar, B. (1992) Combinatorial local planarity and the width of graph embeddings. Canad. J. Math. 44 1272–1288.Google Scholar
[12]Mohar, B. and Thomassen, C. (2001) Graphs on Surfaces, The Johns Hopkins University Press.Google Scholar
[13]Robertson, N. and Seymour, P. D. (1986) Graph minors II: Algorithmic aspects of tree-width. J. Algorithms 7 309–322.Google Scholar
[14]Robertson, N. and Seymour, P. D. (1986) Graph minors V: Excluding a planar graph. J. Combin. Theory Ser. B 41 92–114.Google Scholar
[15]Robertson, N. and Seymour, P. D. (2003) Graph minors XVI: Excluding a non-planar graph. J. Combin. Theory Ser. B 89 43–76.Google Scholar
[16]Robertson, N. and Seymour, P. D. Private communication.Google Scholar
[17]Robertson, N., Seymour, P. D. and Thomas, R. (1994) Quickly excluding a planar graph. J. Combin. Theory Ser. B 62 323–348.Google Scholar
[18]Thomas, R. (1999) Recent excluded minor theorems for graphs. In Surveys in Combinatorics 1999, Vol. 267 of London Math. Soc. Lecture Notes, Cambridge University Press, pp. 201–222.Google Scholar
[19]Thomassen, C. (1997) A simpler proof of the excluded minor theorem for higher surfaces. J. Combin. Theory Ser. B 70 306–311.Google Scholar