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.