Skip to main content
SpringerLink
Log in

A Certifying Algorithm for 3-Colorability of P 5-Free Graphs

  • Conference paper
Algorithms and Computation (ISAAC 2009)

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

Included in the following conference series:

Abstract

We provide a certifying algorithm for the problem of deciding whether a P 5-free graph is 3-colorable by showing there are exactly six finite graphs that are P 5-free and not 3-colorable and minimal with respect to this property.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
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. Bacsó, G., Tuza, Z.: Dominating cliques in P 5-free graphs. Period. Math. Hungar. 21(4), 303–308 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics 164(1), 51–229 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hoàng, C.T., Kaminśki, M., Lozin, V., Sawada, J., Shu, X.: Deciding k-colorability of P5-free graphs in polynomial time. To appear in Algorithmica

    Google Scholar 

  5. Hoàng, C.T., Kaminśki, M., Lozin, V., Sawada, J., Shu, X.: A Note on k-Colorability of P5-Free Graphs. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 387–394. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Korobitsyn, D.V.: On the complexity of determining the domination number in monogenic classes of graphs. Diskret. Mat. 2(3), 90–96 (1990) (in Russian); Translation in Discrete Mathematics and Applications 2(2), 191-199 (1992)

    MATH  Google Scholar 

  7. Kral, D., Kratochvil, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 254–262. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput. 36(2), 326–353 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bang Le, V., Randerath, B., Schiermeyer, I.: On the complexity of 4-coloring graphs without long induced paths. Theoretical Computer Science 389, 330–335 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mellin, S.: Polynomielle Färbungsalgorithmen für P k -freie Graphen, Diplomarbeit am Institut für Informatik, Universität zu Köln (2002)

    Google Scholar 

  11. Randerath, B., Schiermeyer, I.: Vertex coloring and forbidden subgraphs – a survey. Graphs and Combinatorics 20(1), 1–40 (2004)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing and Information Science, University of Guelph, Canada

    Daniel Bruce

  2. Physics and Computer Science, Wilfred Laurier University, Research supported by NSERC, Canada

    Chính T. Hoàng

  3. Computing and Information Science, University of Guelph, Canada, Research supported by NSERC,  

    Joe Sawada

Authors
  1. Daniel Bruce
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chính T. Hoàng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joe Sawada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruce, D., Hoàng, C.T., Sawada, J. (2009). A Certifying Algorithm for 3-Colorability of P 5-Free Graphs. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation