The contents of this book may be conveniently divided into four parts.The first of these (Chapters 1—4)provides a basic foundation course,containing definitions and examples of
graphs,connectedness,Eulerian and Hamiltonian paths and cycles,and trees.This is followed by two chapters (Chapter 5and 6)on planarity and colouring,with special reference to the four—colour
theorem.The third part(Chapters 7and8)deals with the theory of directed graphs and with transversal theory,with applications to critical path analysis,Markov chains and network flows.The book
ends with a chapter on matroids(Chapter 9),which ties together material from the previous chapters and introduces some recent development.