Handbook Of Graph Theory 2Ed (Hb 2014)

In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition―over 400 pages longer than its predecessor―incorporates 14 new sections.

Each chapter includes lists of essential definitions and facts, accompanied by examples, tables, remarks, and, in some cases, conjectures and open problems. A bibliography at the end of each chapter provides an extensive guide to the research literature and pointers to monographs. In addition, a glossary is included in each chapter as well as at the end of each section. This edition also contains notes regarding terminology and notation.

With 34 new contributors, this handbook is the most comprehensive single-source guide to graph theory. It emphasizes quick accessibility to topics for non-experts and enables easy cross-referencing among chapters.

Jonathan Gross is a professor of computer science at Columbia University. A recipient of numerous awards and research grants, Dr. Gross is the coauthor of several books and the inventor of the voltage graph, a construct widely used in topological graph theory and other areas. His current research interests include the genus distribution of graphs, computer graphics, and knot theory.

Jay Yellen is the Archibald Granville Bush Professor of Mathematics at Rollins College, where he has received several teaching and research awards. Dr. Yellen has coauthored one book with Dr. Gross, written materials for IBM courses, and conducted workshops for secondary-school mathematics teachers. His current research interests include graph theory, discrete optimization, and graph algorithms for software testing and course timetabling.

Ping Zhang is a professor of mathematics at Western Michigan University. Dr. Zhang has coauthored five books. Her research interests include algebraic combinatorics and colorings, distance and convexity, traversability, decompositions, and domination within graph theory.