Skip to content
Home/ Algorithmic Graph Theory and Perfect Graphs: Volume 57 (Revised)
Algorithmic Graph Theory and Perfect Graphs: Volume 57 (Revised)

Algorithmic Graph Theory and Perfect Graphs: Volume 57 (Revised)

by Golumbic, Martin Charles
No customer reviews yet ISBN 9780444515308

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.

About the author

Product details

Pub dateFeb 4, 2004
ISBN-100444515305
ISBN-139780444515308
LanguageEnglish
Last updated 2026-03-12 03:05
$92.65
In stock — ships in 24 hours with free tracking
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
Secure checkout. We never store card details.

Readers who bought this also bought

More from Mathematics | Graphic Methods
See all
Fixed Point Theory and Graph Theory: Foundations and Integrative Approaches
<i> <p>Fixed Point Theory and Graph Theory</i> provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. </p> <p>This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. </p> <p>The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.</p>
$115.75
Fast Parallel Algorithms for Graph Matching Problems
Karpinski, Marek
$219.75
Random Geometric Graphs
Penrose, Mathew
$219.75
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$214.27
Graphs, Colourings and the Four-Colour Theorem
Wilson, Robert A
$110.03
Graph Decompositions: A Study in Infinite Graph Theory
Diestel, Reinhard
$100.15