In recent years graph theory has emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. Robin Wilson's book has been widely used as a text for undergraduate courses in mathematics, computer science and economics, and as a readable introduction to the subject for non-mathematicians. The opening chapters provide a basic foundation course, containing definitions and examples, connectedness, Eulerian and Hamiltonian paths and cycles, and trees, with a range of applications. This is followed by two chapters on planar graphs and colouring, with special reference to the four-colour theorem. The next chapter deals with transversal theory and connectivity, with applications to network flows. A final chapter on matroid theory ties together material from earlier chapters, and an appendix discusses algorithms and their efficiency.

Table of Contents

Chapter 1 - Definitions and Examples

Chapter 2 - Paths and Cycles

Chapter 3 - Trees

Chapter 4 - Planarity

Chapter 5 - Colouring Graphs

Chapter 6 - Matching, Marriage, and Menger's Theorem

Chapter 7 - Matroids