Perfect Graphs [Hardcover]

Jorge L. Ramírez-Alfonsín (Editor), Bruce A. Reed (Editor), J.L.R. Alfonsin (Author)

Book Description

Publication Date: September 15, 2001 | ISBN-10: 0471489700 | ISBN-13: 978-0471489702 | Edition: 1

The theory of perfect graphs was born out of a conjecture about graph colouring made by Claude Berge in 1960. That conjecture remains unsolved, but has generated an important area of research in combinatorics. This book:
* Includes an introduction by Claude Berge, the founder of perfect graph theory

* Discusses the most recent developments in the field of perfect graph theory

* Provides a thorough historical overview of the subject

* Internationally respected authors highlight the new directions, seminal results and the links the field has with other subjects

* Discusses how semi-definite programming evolved out of perfect graph theory
The early developments of the theory are included to lay the groundwork for the later chapters. The most recent developments of perfect graph theory are discussed in detail, highlighting seminal results, new directions, and links to other areas of mathematics and their applications. These applications include frequency assignment for telecommunication systems, integer programming and optimisation.

Editorial Reviews

Review

"...illuminates the relationships between perfect graph theory and other fields of scientific enquiry..." (SciTech Book News, Vol. 26, No. 2, June 2002)

From the Back Cover

Perfect graph theory was born out of a conjecture about graph colouring made by Claude Berge in 1960. That conjecture remains unsolved, but it has generated an important area of research in combinatorics. In this first book on the subject, the authors bring together all the questions, methods and ideas of perfect graph theory, and highlight the new methods and applications generated by Berge's conjecture.
* Discusses the most recent developments in the field of perfect graph theory.

* Highlights applications in frequency assignments for telecommunications systems, integer programming and optimization.

* Discusses how semi-definite programming evolved out of perfect graph theory.

* Includes an introduction by Claude Berg.
* Features internationally respected authors.
Primarily of interest to researchers from mathematics, combinatorics, computer science and telecommunications, the book will also appeal to students of graph theory.

Product Details

• Hardcover: 392 pages
• Publisher: Wiley; 1 edition (September 15, 2001)
• Language: English
• ISBN-10: 0471489700
• ISBN-13: 978-0471489702
• Product Dimensions: 10 x 6.8 x 1.1 inches
• Shipping Weight: 1.9 pounds (View shipping rates and policies)
• Average Customer Review: 3.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #3,216,536 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

3.0 out of 5 stars For advanced undergraduate students and above, March 4, 2010

By 

Lauren Felice - See all my reviews

This review is from: Perfect Graphs (Hardcover)

This is not a friendly book in any sense of the word. I didn't find it as cohesive as I imagined it to be. It contains a somewhat random smattering of important original papers about perfect graphs. I used this book as a source for my thesis, and I expected to get more out of it than I did. I ended up only using history from it because it was too advanced for me. I am a senior undergraduate math major with only 1/3 of a semester's experience in graph theory, in an easy combinatorics class. I'm sure someone with more experience will find this book much more useful.