Preface Chapter 1: Basic Concepts Chapter 2: Perfection, Generalized Perfection, and Related Concepts Chapter 3: Cycles, Chords and Bridges Chapter 4: Models and Interactions Chapter 5: Vertex and Edge Orderings Chapter 6: Posets Chapter 7: Forbidden Subgraphs Chapter 8: Hypergraphs and Graphs Chapter 9: Matrices and Polyhedra Chapter 10: Distance Properties Chapter 11: Algebraic Compositions and Recursive Definitions Chapter 12: Decompositions and Cutsets Chapter 13: Threshold Graphs and Related Concepts Chapter 14: The Strong Perfect Graph Conjecture Appendix A: Recognition Appendix B: Containment Relationships Bibliography Index
Request Academic Copy
Please copy the ISBN for submitting review copy form
Description
'Offers a wide and up-to-date panorama on classes of graphs and the corresponding algorithms.' Frederic Maffray, CNRS, Grenoble, France 'An excellent survey of a vast ocean of results ... A must-have for researchers in the field.' Uri N. Peled, University of Illinois at Chicago

