Provides a basic foundation on trees, algorithms, Eulerian and Hamilton graphs, planar graphs and coloring, with special reference to four color theorem. Discusses directed graphs and transversal theory and related these areas to Markov chains and network flows. Paper.
Robin James Wilson (born December 1943) is a professor in the Department of Mathematics at the Open University, a Stipendiary Lecturer at Pembroke College, Oxford[1] and, as of 2006, professor of geometry at Gresham College, London, where he has also been a visiting professor. On occasion, he guest teaches at Colorado College. From January 1999 to September 2003 Robin Wilson was editor-in-chief of the European Mathematical Society Newsletter.[2] He is the son of Harold Wilson, former Prime Minister of the United Kingdom. He has two daughters: Catherine and Jennifer.
I read a chunk of this book for my algorithmics class. The explanations aren't always good, I had to research things on my own every now and then. The exercises are good, but it's a bit of a shame that the most complicated ones aren't provided with solutions.
A good book as a reference to graph theory, but not as a book to learn graph theory because many important aspects are provided as exercises without any additional reference to the correct solution and explanation.