Algorithmic Graph Theory and Perfect Graphs

Algorithmic Graph Theory and Perfect Graphs

2nd Edition - January 29, 2004

Write a review

  • Author: Martin Golumbic
  • Hardcover ISBN: 9780444515308
  • eBook ISBN: 9780080526966

Purchase options

Purchase options
DRM-free (Mobi, PDF, EPub)
Sales tax will be calculated at check-out

Institutional Subscription

Free Global Shipping
No minimum order


Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.

Key Features

  • New edition of the "Classic" book on the topic
  • Wonderful introduction to a rich research area
  • Leading author in the field of algorithmic graph theory
  • Beautifully written for the new mathematician or computer scientist
  • Comprehensive treatment


Mathematic and Computing Libraries, and Graduate Students

Product details

  • No. of pages: 340
  • Language: English
  • Copyright: © North Holland 2004
  • Published: January 29, 2004
  • Imprint: North Holland
  • Hardcover ISBN: 9780444515308
  • eBook ISBN: 9780080526966

About the Author

Martin Golumbic

Affiliations and Expertise

University of Haifa, Isreal.

Ratings and Reviews

Write a review

There are currently no reviews for "Algorithmic Graph Theory and Perfect Graphs"