Skip to main content
SpringerLink
Log in

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2204))

Included in the following conference series:

Abstract

We give a complete characterization of parameter graphs H for which the problem of coloring H-free graphs is polynomial and for which it is NP-complete. We further initiate a study of this problem for two forbidden subgraphs.

This author acknowledges further partial support of Czech research grant GAUK 158/1999.

Research supported in part by the Hungarian Scientific Research Fund, grants OTKA T-026575 and T-032969, and Czech Grant GAFFCR 201/99/0242 (DIMATIA).

Project LN00A056 supported by The Ministry of Education of Czech Republic

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Chvátal, V.: Perfectly ordered graphs, in: Topics on Perfect Graphs (C. Berge, V. Chvátal, eds.), Annals of Discrete Mathematics 21 (1984) 63–65

    Google Scholar 

  2. Erdős, P.: Graph theory and probability, Canad. J. Math. 11 (1959) 34–38.

    MathSciNet  Google Scholar 

  3. Fellows, M.R., Kratochvíl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems, Algorithmica 13 (1995) 266–282

    Article  MATH  MathSciNet  Google Scholar 

  4. Holyer, I.: The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718–720.

    Article  MATH  MathSciNet  Google Scholar 

  5. Lichtenstein, D.: Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329–343.

    Article  MATH  MathSciNet  Google Scholar 

  6. Maffray, F., Preissmann, M.: On the NP-completeness of the k-colorability problem for triangle-free graphs, Discr. Math. 162 (1996), 313–317

    Article  MATH  MathSciNet  Google Scholar 

  7. Olariu, S.: Paw-free graphs, Inform. Process. Lett. 28 (1988), 53–54

    Article  MATH  MathSciNet  Google Scholar 

  8. Randerath, B., Schiermeyer, I.: 3-colorability in P for P 6-free graphs, Rutcor Research Report 39-2001, ext. abstract in Electronic Notes in Discrete Math., Vol. 8 (2001).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostranské nám. 25, 118 00, Prague, Czech Republic

    Daniel Král’ & Jan Kratochvíl

  2. Computer and Automation Institute, Hungarian Academy of Sciences, H-1111, Budapest, Kende u. 13-17, Hungary

    Zsolt Tuza

  3. Department of Computer Science, Hungary

    Zsolt Tuza

  4. Technical university Graz, Austria

    Gerhard J. Woeginger

Authors
  1. Daniel Král’
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Kratochvíl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zsolt Tuza
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gerhard J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rostock, 18051, Rostock, Germany

    Andreas Brandstädt  & Van Bang Le  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Král’, D., Kratochvíl, J., Tuza, Z., Woeginger, G.J. (2001). Complexity of Coloring Graphs without Forbidden Induced Subgraphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45477-2_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42707-0

  • Online ISBN: 978-3-540-45477-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation