Atnaujinkite slapukų nuostatas

Graph Classes: A Survey [Minkštas viršelis]

  • Formatas: Paperback / softback, 315 pages, aukštis x plotis x storis: 228x151x13 mm, weight: 580 g, Illustrations
  • Serija: SIAM Monographs on Discrete Mathematics and Applications No. 3
  • Išleidimo metai: 30-Jun-1999
  • Leidėjas: Society for Industrial & Applied Mathematics,U.S.
  • ISBN-10: 089871432X
  • ISBN-13: 9780898714326
Kitos knygos pagal šią temą:
  • Formatas: Paperback / softback, 315 pages, aukštis x plotis x storis: 228x151x13 mm, weight: 580 g, Illustrations
  • Serija: SIAM Monographs on Discrete Mathematics and Applications No. 3
  • Išleidimo metai: 30-Jun-1999
  • Leidėjas: Society for Industrial & Applied Mathematics,U.S.
  • ISBN-10: 089871432X
  • ISBN-13: 9780898714326
Kitos knygos pagal šią temą:
A reference on graph classes, containing a survey of some 200 classes of graphs. Information is organized by types of properties used to define and characterize classes, with key theorems and literature references cited for each class. Emphasis is on the algorithmic point of view. Results are stated without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided. For anyone who works with special classes of graphs in understanding, refereeing, and writing mathematical papers. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Recenzijos

'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

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