Algorithmic Graph Theory and Perfect Graphs

Algorithmic Graph Theory and Perfect Graphs, 2nd Edition

Algorithmic Graph Theory and Perfect Graphs, 2nd Edition,Martin Golumbic,ISBN9780444515308


North Holland




240 X 165

Covers many applications associated with classes of perfect graphs.

Print Book + eBook

USD 116.97
USD 194.95

Buy both together and save 40%

Print Book


In Stock

Estimated Delivery Time
USD 88.95

eBook Overview

VST (VitalSource Bookshelf) format

DRM-free included formats : PDF

USD 106.00
Add to Cart

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


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.


Mathematic and Computing Libraries, and Graduate Students.

Martin Golumbic

Affiliations and Expertise

University of Haifa, Isreal.

Quotes and reviews

"(...) this volume is, as was its predecessor, an excellent and motivating introduction to the world of perfect graphs", D. de Werra (CH-LSNP; Lausanne) in: Mathematical Reviews 2005e: 05061.
Free Shipping
Shop with Confidence

Free Shipping around the world
▪ Broad range of products
▪ 30 days return policy

Contact Us