Skip to main content
SpringerLink
Log in

3-Colouring AT-Free Graphs in Polynomial Time

  • Conference paper
Algorithms and Computation (ISAAC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6507))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brandstädt, A., Dragan, F.F., Le, V.B., Szymczak, T.: On stable cutsets in graphs. Discrete Applied Mathematics 105, 39–50 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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)

    Article  MathSciNet  MATH  Google Scholar 

  3. Corneil, D., Stacho, J.: The structure and recognition of C 4-free AT-free graphs (2010) (manuscript)

    Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  5. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hemper, H., Kratsch, D.: On claw-free asteroidal triple-free graphs. Discrete Applied Mathematics 121, 155–180 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Müller, H.: Personal communication

    Google Scholar 

  10. Randerath, B., Schiermeyer, I.: 3-colorability \(\in{\cal P}\) for P 6-free graphs. Discrete Applied Mathematics 136, 299–313 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sgall, J., Woeginger, G.J.: The complexity of coloring graphs without long induced paths. Acta Cybernetica 15, 107–117 (2001)

    MathSciNet  MATH  Google Scholar 

  12. Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  13. West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Physics and Computer Science, Wilfrid Laurier University, 75 University Ave W, Waterloo, ON, N2L 3C5, Canada

    Juraj Stacho

Authors
  1. Juraj Stacho
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, KAIST, Gwahangno 335, Yuseong-gu, 305-701, Daejeon, Korea

    Otfried Cheong  & Kyung-Yong Chwa  & 

  2. School of Computer Science and Engineering, Seoul National University, 151-742, Seoul, Korea

    Kunsoo Park

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation