Skip to main content

Algorithmic Graph Theory and Perfect Graphs

  • 2nd Edition, Volume 57 - January 29, 2004
  • Author: Martin Charles Golumbic
  • Language: English
  • Hardback ISBN:
    9 7 8 - 0 - 4 4 4 - 5 1 5 3 0 - 8
  • eBook ISBN:
    9 7 8 - 0 - 0 8 - 0 5 2 6 9 6 - 6

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 t… Read more

Algorithmic Graph Theory and Perfect Graphs

Purchase options

Limited Offer

Save 50% on book bundles

Immediately download your ebook while waiting for your print delivery. No promo code is needed.

Book bundle cover eBook and print

Institutional subscription on ScienceDirect

Request a sales quote

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.