Schaum's Outline of Graph Theory: Including Hundreds of Solved Problems

Good book, but condition less than expected

Good.

Bought used since it is just for a semester module in graph theory, but it actually looked brand new. Happy with my purchase!

thanks

excellent book, really useful

I was a useful book. It did what it was supposed to do. However, I bought it because I was hoping it would make more sense than my lecturer did and that I could clarify my notes using it but it was sometimes just as confusing. No particular complaints but could have been a bit more explanatory and not so technical.

This book offers a lot of content for a low price. That's the good thingabout it.The bad thing is that it's difficult to read - it's very dry and boring.Of course, pretty much everything in mathematics is dry and boring, but Iknow lots of math books which teach far more efficiently than this one. Itgives too many examples and often doesn't go straight to the point, and itdidn't make it clear why the hell one would want to learn about grouptheory.Also, the some notation used in this book is outdated, which is slightlyannoying at times as it just adds to the confusion of a confusing subject.

I bought this to supplement an OU course. Basic ideas well explained with lots of examples to reinforce the concepts.

Great overview of graph theory concepts

Delivery was fast, and item was in perfect condition, just as explained in the ad. This is a nice book on graph theory, which includes many good problems with their solutions. Thank you very much.

I think the Schaum's Outline, Graph Theory, by V.K. Balakrishanan is a wonderful introduction to graph theory. I decided to write this review after reading some negative reviews of this book. I'm trained in mathematics so I understand that theorems and proofs must be studied carefully and thoughtfully before they make sense. But if one takes the necessary time with this book he or she will come away with a good grasp of the fundamentals of graph theory. Such major topics as connectivity, Hamiltonian graphs, trees, network flows, matching and factors, graph embeddings, and graph coloring are thoroughly covered with carefully worked out problems and proofs. In the chapter on Hamiltonian graphs, for example, we learn about the sequence of theorems by Dirac, Ore, Posa, Bondy, and Chvatal - each one implying its predecessor. The Kruskal and Prim algorithms are covered in the chapter on trees and there is even a mention of matroids here. The max-flow-min-cut theorem by Ford and Fulkerson is derived in the chapter on network flows and from this Menger's theorem is deduced. Tutte's famous theorem on matchings in general graphs is covered in the chapter on matching and factors. The beautiful proof alone by Lovasz of Tutte's theorem is worth the price of the book. Important theorems by Whitney, Konig, Hall, and Dilworth are all here. The chapter on graph coloring has the theorems of Brooks, Vizing, and Heawood, and even a section on reducible graphs and unavoidable sets (which provides the basis for the proof of the Four Color Theorem) What's missing? This book was published in 1997 so there is no mention of the Graph Minor Theorem. But if a student were to master the material in the Schaum's Outline, Graph Theory, he or she would be ready to tackle the Graph Minor Theorem.

It lacks any details on the topic, and is really incoherent. Cannot be used in itself, only with the courses it is made for.

Great review of the area. Not exactly a classic text, but instructive.