Skip to main content
SpringerLink
Log in

Algorithmic graph theory and perfect graphs

M. C. Golumbic: Academic Press, 1980, ISBN 0-12-289260-7

  • Books in Review
  • Published:
Order Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C. Berge and V. Chvátal (eds.) (1984) Topics on perfect graphs, Ann. Discrete Math. 21.

  2. P. C.Fishburn (1985) Interval Orders and Interval Graphs, A Study of Partially Ordered Sets, John Wiley, New York.

    Google Scholar 

  3. M. C. Golumbic (ed.) (1985) Special issue on interval graphs and related topics, Discrete Math. 55 (2).

  4. I.Rival (ed.) (1985) Graphs and Order, D. Reidel, Dordrecht.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bonn, Germany

    Rolf H. Möhring

Authors
  1. Rolf H. Möhring
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Möhring, R.H. Algorithmic graph theory and perfect graphs. Order 3, 207–208 (1986). https://doi.org/10.1007/BF00390110

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00390110

Search

Navigation