9780471489702-0471489700-Perfect Graphs

Perfect Graphs

ISBN-13: 9780471489702
ISBN-10: 0471489700
Edition: 1
Author: Bruce A. Reed, J.L.R. Alfonsin, Jorge L. Ramírez-Alfonsín
Publication date: 2001
Publisher: Wiley
Format: Hardcover 392 pages
FREE US shipping

Book details

ISBN-13: 9780471489702
ISBN-10: 0471489700
Edition: 1
Author: Bruce A. Reed, J.L.R. Alfonsin, Jorge L. Ramírez-Alfonsín
Publication date: 2001
Publisher: Wiley
Format: Hardcover 392 pages

Summary

Perfect Graphs (ISBN-13: 9780471489702 and ISBN-10: 0471489700), written by authors Bruce A. Reed, J.L.R. Alfonsin, Jorge L. Ramírez-Alfonsín, was published by Wiley in 2001. With an overall rating of 4.1 stars, it's a notable title among other Computer Science (Graphics & Design) books. You can easily purchase or rent Perfect Graphs (Hardcover) from BooksRun, along with many other new and used Computer Science books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.3.

Description

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.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book