Skip to main content
Log in

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

Access this article

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

Instant access to the full article PDF.

Literature

  1. Gregory R, Karney D (1969) A Collection of Matrices for Testing Computational Algorithms. Wiley-Interscience, New York, London

    Google Scholar 

References

  1. Bogart KP (1983) Introductory combinatorics. Pitman, Boston

    MATH  Google Scholar 

  2. Bogart KP (1984) What should a Discrete Mathematics course be? Preprint, Dortmouth

  3. Bondy JA, Murty USR (1976) Graph theory with applications. MacMillan, London

    Google Scholar 

  4. Communications of ACM, January 1982, vol 25, no 1

  5. Oberschelp W, Wille D (1976) Mathematischer Einführungskurs für Informatiker. Teubner, Stuttgart

    MATH  Google Scholar 

  6. Panel on Discrete Mathematics. Preliminary Report, American Mathematical Association, November 1984

  7. Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  8. Tucker A (1980) Applied combinatorics. Wiley, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grauer, M., Colhourn, Rüschendorf, L. et al. Book review. Zeitschrift für Operations Research 31, A210–A220 (1987). https://doi.org/10.1007/BF02109598

Download citation

  • Issue Date:

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

Navigation