Pearls in Graph Theory

Short description: 1990 book by Gerhard Ringel and Nora Hartsfield

Pearls in Graph Theory: A Comprehensive Introduction

Author| Nora Hartsfield and Gerhard Ringel
Subject| Graph theory
Genre| Textbook
Publisher| Academic Press

Publication date

| 1990

Pearls in Graph Theory: A Comprehensive Introduction is an undergraduate-level textbook on graph theory by Nora Hartsfield and Gerhard Ringel. It was published in 1990 by Academic Press[1][2][3] with a revised edition in 1994[4] and a paperback reprint of the revised edition by Dover Books in 2003.[5] The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.[5]

## Contents

* 1 Topics
* 2 Audience and reception
* 3 References
* 4 External links

## Topics

The "pearls" of the title include theorems, proofs, problems, and examples in graph theory. The book has ten chapters; after an introductory chapter on basic definitions, the remaining chapters material on graph coloring; Hamiltonian cycles and Euler tours; extremal graph theory; subgraph counting problems including connections to permutations, derangements, and Cayley's formula; graph labelings; planar graphs, the four color theorem, and the circle packing theorem; near-planar graphs; and graph embedding on topological surfaces.[4][5]

The book also includes several unsolved problems such as the Oberwolfach problem on covering complete graphs by cycles, the characterization of magic graphs, and Ringel's Earth–Moon problem on coloring biplanar graphs.[3]

Despite its subtitle "A comprehensive introduction", the book is short and its selection of topics reflects author Ringel's personal interests.[1][5] Important topics in graph theory that are not covered[1][4]include symmetries of graphs, cliques, connections between graphs and linear algebra including adjacency matrices, algebraic graph theory and spectral graph theory, connectivity of a graph (or even biconnected components), Hall's marriage theorem, line graphs, interval graphs, and the theory of tournaments. There is also only one chapter of coverage on algorithms and real-world applications of graph theory.[1][4][5] Also, the book omits "difficult or long proofs".[2][5]

## Audience and reception

The book is written as a lower-level undergraduate textbook and recommends that students using it have previously taken a course in discrete mathematics. Nevertheless, it can be read and understood by students with only a high school background in mathematics. Reviewer L. W. Beineke writes that the variety of levels of the exercises is one of the strengths of the book,[4] and reviewer John S. Maybee writes that they are "extensive" and provide interesting connections to additional topics;[1] however, reviewer J. Sedláček criticizes them as "routine".[2]

Although several reviewers complained about the book's spotty or missing coverage of important topics,[1][4][5] reviewer Joan Hutchinson praised its choice of topics as "refreshingly different" and noted that, among many previous texts on graph theory, none had as much depth of coverage of topological graph theory.[3] Other reviewer complaints include a misattributed example,[2] a bad definition of the components of a graph that failed to apply to graphs with one component,[5] and a proof of the five-color theorem that only applies to special planar maps instead of all planar graphs.[3]

Despite these complaints, Beineke writes that, as an undergraduate text, "this book has much to offer".[4] Maybee writes that the book was "a joy to read", provided better depth of coverage on some topics than previous graph theory texts, and would be helpful reading for "many graph theorists".[1] Hutchinson praises it as providing "a splendid, enticingly elementary yet comprehensive introduction to topological graph theory".[3]

## References

1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 1.6 "Review of Pearls in Graph Theory (1st ed.)", SIAM Review 33 (4): 664–665, December 1991
2. ↑ 2.0 2.1 2.2 2.3 Sedláček, J., "Review of Pearls in Graph Theory (1st ed.)", zbMATH
3. ↑ 3.0 3.1 3.2 3.3 3.4 Hutchinson, Joan P. (November 1991), "Review of Pearls in Graph Theory (revised ed.)", American Mathematical Monthly 98 (9): 873–875, doi:10.2307/2324291
4. ↑ 4.0 4.1 4.2 4.3 4.4 4.5 4.6 Beineke, L. W. (March 1996), "Review of Pearls in Graph Theory (revised ed.)", SIAM Review 38 (1): 159, doi:10.1137/1038017 ; see also Beineke's shorter review in MR1282717
5. ↑ 5.0 5.1 5.2 5.3 5.4 5.5 5.6 5.7 Hunacek, Mark (September 2015), "Review of Pearls in Graph Theory (Dover ed.)", MAA Reviews (Mathematical Association of America), https://www.maa.org/press/maa-reviews/pearls-in-graph-theory-a-comprehensive-introduction

## External links

* Pearls in Graph Theory (1st ed.) at the Internet Archive

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Pearls in Graph Theory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Pearls_in_Graph_Theory&oldid=4151791"