This second edition includes two new one on domination in graphs and the other on the spectral properties of graphs, the latter including a discussion on graph energy. The chapter on graph colorings has been enlarged, covering additional topics such as homomorphisms and colorings and the uniqueness of the Mycielskian up to isomorphism. This book also introduces several interesting topics such as Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices, and a concrete application of triangulated graphs.
I started to read this book in order to fill a gap in my education. I was trained as a mathematician a long time ago, but somehow always managed to avoid courses on graph theory.
I was rewarded with a breadth-first presentation of this rich subject. The authors take care to guide us from elementary concepts to some of the more recent advanced results. This comes at the cost of continuity: many chapters represent a somewhat unnatural break from the preceding ones. In some cases there is even a repetition of the same definition in different terms, e.g., the definition of the different types of graph product in chapter 1 appears somewhat disconnected from the concept of a non-complete extended P-sum in chapter 11 even though they represent the same underlying idea.
For a second edition this book appears sloppily edited, if at all. I know that Springer tries to cut costs, but surely the authors could have gathered some feedback from early readers to eliminate many of the time-wasting typos in mathematical expressions?
Most chapters offer a useful review in the form of perfectly doable exercises.