Skip to main content
SpringerLink
Log in

Induced subraph isomorphism for cographs is NP-complete

  • Graph Algorithms And Complexity
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1990)

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

Included in the following conference series:

Abstract

We prove by a reduction from 3SAT that the INDUCED SUBGRAPH ISOMORPHISM problem remains NP-complete when restricted to cographs (P4-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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.L. Bodlaender, ACHROMATIC NUMBER is NP-complete for cographs and interval graphs, Info. Proc. Letters 31 (1989), 135–138

    Google Scholar 

  2. D.G. Corneil, H. Lerchs, L. Stuart Burlingham, Complement reducible graphs, Discr. Appl. Math. 3 (1981), 163–174

    Google Scholar 

  3. P.Damaschke, Induced subgraphs and well-quasi ordering, to appear in J. of Graph Theory

    Google Scholar 

  4. M.R. Garey, D.S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, Freeman, San Francisco 1979

    Google Scholar 

  5. M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York 1980

    Google Scholar 

  6. N.Robertson, P.D.Seymour, Graph minors, J. of Comb. Theory (B), 1983 ff.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Friedrich-Schiller-Universität Jena, Sektion Mathematik Universitätshochhaus, O-6900, Jena, FRG

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Damaschke, P. (1991). Induced subraph isomorphism for cographs is NP-complete. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-53832-1_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53832-5

  • Online ISBN: 978-3-540-46310-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation