Perfect Graphs (Hardback)
  • Perfect Graphs (Hardback)

Perfect Graphs (Hardback)

Hardback 386 Pages
Published: 14/09/2001
  • We can order this from the publisher

UK delivery within 3-4 weeks

  • This item has been added to your basket
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.

Publisher: John Wiley & Sons Inc
ISBN: 9780471489702
Number of pages: 386
Weight: 726 g
Dimensions: 244 x 168 x 22 mm

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

You may also be interested in...

Introduction to Lattices and Order
Added to basket
Concise Computer Mathematics
Added to basket
Schaum's Outline of Combinatorics
Added to basket
Graph Theory As I Have Known It
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Principia Mathematica - Volume One
Added to basket
Principia Mathematica - Volume Two
Added to basket
Introduction to Graph Theory
Added to basket

Please sign in to write a review

Your review has been submitted successfully.