<< 1 >>
Rating: 
Summary: Exellent Introduction
Review: Almost no pre-requisites are needed for this book, (There is a short section which touches on Linear Alg, and another on very elementary topology) and yet it will take you from the very basic notions, to research level problems in this subject. It covers almost all the major notions about graphs, including coloring, matching, flows... Any reader is bound to find the section on Ramsey theory especially interesting. However, infinite graphs and Algebric graph theory are not covered.There is a useful commentary on the references at the end of each chapter.
Rating:
Summary: Small yet comprehensive.
Review: An excellent book. With minimum knowledge and an open mind, you can work rapidly throughout this book. I used it as a reference for some work I'm currently doing on the structure of extremal graphs and it came in very handy. To sum up, it's what you would normally expect from Springer's series on grad math texts.
Rating: 
Summary: Dense reading
Review: I have to read this book to prepare for a summer research program; however unfortunately for a high school student, this text is unreasonably concise with the proofs and makes for very tough independent study.
Rating:
Summary: An exciting book.
Review: Really, this book is very nice. It is simple to read (its language is quite easy) yet serious and precise. It covers many important aspects of the pure graph theory , leaving there applications and algorithms to an algorithmic graph theory book. So, to learn the core of the pure graph theory, this book is your choice, espesially if you are a computer science student (Because it dosen't deal deeply with tough mathematics).
<< 1 >>
| 
