Skip to content
Register Sign in Wishlist
Graph Classes

Graph Classes
A Survey

$127.00 (P)

Part of Monographs on Discrete Mathematics and Applications

  • Date Published: January 1987
  • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • format: Paperback
  • isbn: 9780898714326

$ 127.00 (P)
Paperback

This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Unavailable Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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. If you've had difficulty keeping track of the literature in this field or are confused by the use of different terminology for the same known results, then this comprehensive book is for you. It will be especially useful to anyone who works with special classes of graphs in understanding, refereeing, and writing papers.

    Reviews & endorsements

    '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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: January 1987
    • format: Paperback
    • isbn: 9780898714326
    • length: 316 pages
    • dimensions: 254 x 178 x 14 mm
    • weight: 0.562kg
    • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • Table of Contents

    Preface
    1. Basic Concepts
    2. Perfection, Generalized Perfection, and Related Concepts
    3. Cycles, Chords and Bridges
    4. Models and Interactions
    5. Vertex and Edge Orderings
    6. Posets
    7. Forbidden Subgraphs
    8. Hypergraphs and Graphs
    9. Matrices and Polyhedra
    10. Distance Properties
    11. Algebraic Compositions and Recursive Definitions
    12. Decompositions and Cutsets
    13. Threshold Graphs and Related Concepts
    14. The Strong Perfect Graph Conjecture
    Appendix A. Recognition
    Appendix B. Containment Relationships
    Bibliography
    Index.

  • Authors

    Andreas Brandstädt, Universität Rostock, Germany

    Van Bang Le, Universität Rostock, Germany

    Jeremy P. Spinrad, Vanderbilt University, Tennessee

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×