Skip to main content
SpringerLink
Log in

Forbidden Ordered Subgraphs

  • Chapter
Topics in Combinatorics and Graph Theory

Abstract

There are many special classes of undirected graphs which occur permanently in the literature in several contexts. These classes are interesting for their structural properties, and they are motivated from applications.

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.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. V.Chvatal, Perfectly ordered graphs, Annals of Discr. Math. 21 (1984), 63–65

    Google Scholar 

  2. E.Dahlhaus, private communication

    Google Scholar 

  3. P.Duchet, Representations, noyaux en theorie des graphes and hypergraphes, Doct. Diss. Univ. Paris 6 (1979)

    Google Scholar 

  4. P.Duchet, Classical perfect graphs, Annals of Discr. Math. 21 (1984), 67–96

    MathSciNet  Google Scholar 

  5. B.Dushnik, E.W.Miller, Partially ordered sets, Amer. J. Math. 63 (1941), 600–610

    Article  MathSciNet  Google Scholar 

  6. M.Farber, Characterizations of strongly chordal graphs, Discr. Math. 43 (1983), 173–189

    Article  MathSciNet  MATH  Google Scholar 

  7. S.Foldes, P.L.Hammer, Split graphs, Proc. 8th Southeastern Conf. on Comb., Graph Th. and Computing (1977), 311–315

    Google Scholar 

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

    MATH  Google Scholar 

  9. M.C.Golumbic, Algorithmic graph theory and perfect graphs, Acad. Press, New York 1980

    MATH  Google Scholar 

  10. M.C.Golumbic, Interval graphs and related topics, Discr. Math. 55 (1985), 113–121

    Article  MathSciNet  MATH  Google Scholar 

  11. D.S. Johnson, The NP-completeness column: an ongoing guide, in: J. of Algorithms, to be continued

    Google Scholar 

  12. A.Kotzig, Paare Hajös Graphen, Casop. Pest. Mat. 88 (1963), 236–241

    MathSciNet  MATH  Google Scholar 

  13. D.Kratsch, private communication

    Google Scholar 

  14. R.H.Möhring, Computationally tractable classes of ordered sets, Preprint Reihe Math. 181/1987, Techn. Univ. Berlin(West)

    Google Scholar 

  15. G.Ramalingham, C. Pandu Rangan, A unified approach to domination problems on interval graphs, Info. Proc. Letters 27 (1988), 271–274

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jena, GDR

    P. Damaschke

Authors
  1. P. Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematik und ihre Didaktik, Pädagogische Hochschule Kiel, Olshausenstraße 75, 2300, Kiel, Germany

    Rainer Bodendiek

  2. Institut für Statistik und Mathematische Wirtschaftstheorie, Universität Karlsruhe, Rechenzentrum, Zirkel 2, Postfach 6980, 7500, Karlsruhe, Germany

    Rudolf Henn

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Physica-Verlag Heidelberg

About this chapter

Cite this chapter

Damaschke, P. (1990). Forbidden Ordered Subgraphs. In: Bodendiek, R., Henn, R. (eds) Topics in Combinatorics and Graph Theory. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46908-4_25

  • Publisher Name: Physica-Verlag HD

  • Print ISBN: 978-3-642-46910-7

  • Online ISBN: 978-3-642-46908-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation