Pearls in Graph Theory: A Comprehensive Introduction

by Nora Hartsfield, Gerhard Ringel

"Innovative introductory text . . . clear exposition of unusual and more advanced topics . . . Develops material to substantial level." — American Mathematical Monthly
"Refreshingly different . . . an ideal training ground for the mathematical process of investigation, generalization, and conjecture leading to the discovery of proofs and counterexamples." — American Mathematical Monthly
" . . . An excellent textbook for an undergraduate course." — Australian Computer Journal
A stimulating view of mathematics that appeals to students as well as teachers, this undergraduate-level text is written in an informal style that does not sacrifice depth or challenge. Based on 20 years of teaching by the leading researcher in graph theory, it offers a solid foundation on the subject. This revised and augmented edition features new exercises, simplifications, and other improvements suggested by classroom users and reviewers. Topics include basic graph theory, colorings of graphs, circuits and cycles, labeling graphs, drawings of graphs, measurements of closeness to planarity, graphs on surfaces, and applications and algorithms. 1994 edition.

Genres: Mathematics

272 pages, Paperback

First published January 1, 1990

Reviews

[Jeff Yoak · Rating 5 out of 5]

It's been quite a while since I've enjoyed a non-puzzle math book this much. While it requires mathematical reasoning, there is very little technique that it specifically requires so I can recommend it to anyone who is curious. I reached a point about half way through where it would have taken serious work to continue unlike the fairly casual reading it had been up to then. Not having energy to do that is why I abandoned it rather than any fault in the book. I plan to pick it up again at some point.

[Nick Black · Rating 4 out of 5]

Skimmed through most of this; it looked good, and there were several wonderful examples I'd never seen before (generally, results I'd seen achieved with trivial topological results, but not through a "pure" graph theory methodology).