## Algorithmic Graph Theory and Perfect Graphs: Second Edition (Google eBook)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. · 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 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

22 | |

Chapter 3 Perfect Graphs | 51 |

Chapter 4 Triangulated Graphs | 81 |

Chapter 5 Comparability Graphs | 105 |

Chapter 6 Split Graphs | 149 |

Chapter 7 Permutation Graphs | 157 |

Chapter 8 Interval Graphs | 171 |

### Common terms and phrases

Adj(v Adj(x adjacency sets algorithm applications arcs assignment assume called Chapter characterization chordal bipartite graph chordal graphs chordless cycle chords circular-arc graphs clique cover clique matrix clique of G color classes comparability graph complement Corollary corresponding data structure decomposition defined denote derived graph Discrete Math endpoint equivalent example exists function Golumbic graph G graph in Figure Graph Theory implication class implies induced subgraph integer intersection graph interval graph isomorphic labeling Lemma Let G linear maximum clique maximum stable set minimal minimum n x n NP-complete obtain orientation of G partially ordered sets partition path perfect elimination scheme permutation graph polynomial problem Proc Proof Prove the following queue representation result satisfies Section semiorder simplex simplicial split graph strong perfect graph subset subtrees superperfect Theorem threshold graph tolerance graphs topological sorting transitive orientation tree triangulated graphs Trotter undirected graph Univ vertices of G