1. Basic Graph Theory.- 2. Algorithms and Complexity.- 3. Shortest Paths.- 4. Spanning Trees.- 5. The Greedy Algorithm.- 6. Flows.- 7. Applications in Combinatorics.- 8. Colourings.- 9. Circulations.- 10. Synthesis of Networks.- 11. Connectivity.- 12. Matchings.- 13. Weighted Matchings.- 14. A Hard Problem: The TSP.- A. Solutions.- B. List of Symbols.- References.

Revised throughout

Includes new chapters on the network simplex algorithm and a section on the five color theorem

Recent developments are discussed