- Membership
- Publications
- Meetings
- Competitions
- Community
- Programs
- Students
- High School Teachers
- Faculty and Departments
- Underrepresented Groups
- MAA Awards
- MAA Grants
- News
- About MAA

The Basic Library List Committee suggests that undergraduate mathematics libraries consider this book for acquisition.
Preface; 1. Introducing graphs and algorithmic complexity; 2. Spanning-trees, branchings and connectivity; 3. Planar graphs; 4. Networks and flows; 5. Matchings; 6. Eulerian and Hamiltonian tours; 7. Colouring graphs; 8. Graph problems and intractability; Appendix; Author Index; Subject Index.