/

Graph Classes A Survey

Brandstädt, Andreas Le Van Bang Spinrad Jeremy P.
Heftet / 1999 / Engelsk

Product details

ISBN
9780898714326
Published
1999-06-30
Publisher
Society for Industrial & Applied Mathematics,U.S.; Society for Industrial & Applied Mathematics,U.S.
Weight
580 gr
Height
228 mm
Width
151 mm
Thickness
13 mm
Age
P, 06
Language
Product language
Engelsk
Format
Product format
Heftet
Number of pages
315

Author
Brandstädt, Andreas
Le Van Bang
Spinrad Jeremy P.

Graph Classes A Survey

Brandstädt, Andreas Le Van Bang Spinrad Jeremy P.
Heftet / 1999 / Engelsk
Brandstädt, Andreas Le Van Bang Spinrad Jeremy P.
Heftet / 1999 / Engelsk
Online price:
1.771,-
Levering 7-20 dager
Check availability in stores

'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

This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results 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 to make the book useful to a variety of readers.
Read more
This well-organised reference is a definitive encyclopaedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each.
Read more
  • 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
    Read more

    Related products

    '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

    This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results 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 to make the book useful to a variety of readers.
    Read more
    This well-organised reference is a definitive encyclopaedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each.
    Read more
    • 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
      Read more

      Product details

      ISBN
      9780898714326
      Published
      1999-06-30
      Publisher
      Society for Industrial & Applied Mathematics,U.S.; Society for Industrial & Applied Mathematics,U.S.
      Weight
      580 gr
      Height
      228 mm
      Width
      151 mm
      Thickness
      13 mm
      Age
      P, 06
      Language
      Product language
      Engelsk
      Format
      Product format
      Heftet
      Number of pages
      315

      Author
      Brandstädt, Andreas
      Le Van Bang
      Spinrad Jeremy P.

      Related products