Reseñas proporcionadas por Syndetics

CHOICE Review

Apparently a compilation of the authors' favorite results in graph theory, from the classic to the obscure, loosely tied together by the theme of "distance" or "connectivity." The book is based on the widely known Graph Theory (1969) by Frank Harary, one of the most prolific authors in the field. Although the stated audience includes advanced undergraduates, the book seems most appropriate as a reference for graduate students or researchers working in this area of graph theory. The text has a very terse "definition-theorem" style. Many of the proofs are not given, although there is an extensive list of references. The book is divided into two parts; the first part gives many results involving characterizing graphs or finding extremal graphs with a given property P, and Part 2 is a brief introduction to algorithmic graph problems but is less useful for reference than the many other standard works on algorithms. The typesetting by the authors is well done, but the labels on figures are somewhat hard to read. -D. S. Franzblau, Vassar College