The opening chapters provide a basic foundation course, containing such topics as trees, Eulerian and Hamiltonian graphs, planar graphs, and colouring, with special reference to the four-colour theorem. Following, there are two chapters on directed graphs and transversal theory, relating these areas to such subjects as Markov chains and network flows. Finally, there is a chapter on matroid theory, which is used to consolidate some of the material from earlier chapters.
For this new edition, in addition to improvements in the text, the exercises have been completely revised, and there is now a full range of problems of varying difficulty.