The tables of contents below are with reference to the first printing of the book.  In the second printing, a slight reorganization of material has led to minor changes in the contents of Chapters 12, 14 and 19.

  2. Subgraphs
  3. Connected Graphs
  4. Trees
  5. Nonseparable Graphs
  6. Tree-Search Algorithms
  7. Flows in Networks
  8. Complexity of Algorithms
  9. Connectivity
  10. Planar Graphs
  11. The Four-Colour Problem
  12. Stable Sets and Cliques
  13. The Probabilistic Method
  14. Vertex Colourings
  15. Colourings of Maps
  16. Matchings
  17. Edge Colourings
  18. Hamilton Cycles
  19. Coverings and Packings in Directed Graphs
  20. Electrical Networks
  21. Integer Flows and Coverings