Abstract
Determining the complexity of the colouring problem on AT-free graphs is one of long-standing open problems in algorithmic graph theory. One of the reasons behind this is that AT-free graphs are not necessarily perfect unlike many popular subclasses of AT-free graphs such as interval graphs or co-comparability graphs. In this paper, we resolve the smallest open case of this problem, and present a polynomial time algorithm for 3-colouring of AT-free graphs.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Brandstädt, A., Dragan, F.F., Le, V.B., Szymczak, T.: On stable cutsets in graphs. Discrete Applied Mathematics 105, 39–50 (2000)
Broersma, H., Kloks, T., Kratsch, D., Müller, H.: Independent sets in asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics 12, 276–287 (1999)
Corneil, D., Stacho, J.: The structure and recognition of C 4-free AT-free graphs (2010) (manuscript)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)
Hemper, H., Kratsch, D.: On claw-free asteroidal triple-free graphs. Discrete Applied Mathematics 121, 155–180 (2002)
Hoàng, C.T., Kaminski, M., Lozin, V.V., Sawada, J., Shu, X.: Deciding k-colorability of P 5-free graphs in polynomial time. Algorithmica 57, 74–81 (2010)
Král, D., et al.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandstädt, A., Le Van, B. (eds.) WG 2001. LNCS, vol. 2204, pp. 254–262. Springer, Heidelberg (2001)
Müller, H.: Personal communication
Randerath, B., Schiermeyer, I.: 3-colorability \(\in{\cal P}\) for P 6-free graphs. Discrete Applied Mathematics 136, 299–313 (2004)
Sgall, J., Woeginger, G.J.: The complexity of coloring graphs without long induced paths. Acta Cybernetica 15, 107–117 (2001)
Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stacho, J. (2010). 3-Colouring AT-Free Graphs in Polynomial Time. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17514-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-17514-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17513-8
Online ISBN: 978-3-642-17514-5
eBook Packages: Computer ScienceComputer Science (R0)