Skip to content
Register Sign in Wishlist

Topics in Structural Graph Theory

£69.99

Part of Encyclopedia of Mathematics and its Applications

Ortrud R. Oellermann, Lowell W. Beineke, Robin J. Wilson, Dirk Meierling, Lutz Volkmann, Matthias Kriesell, Kiyoshi Ando, R. J. Faudree, Michael Ferrara, Ronald J. Gould, Dieter Rautenbach, Bruce Reed, Ian Anderson, Keith Edwards, Graham Farr, Béla Bollobás, Oliver Riordan, F. T. Boesch, A. Satyanarayana, C. L. Suffel, Abdol-Hossein Esfahanian, R. A. Bailey, Peter J. Cameron
View all contributors
  • Date Published: November 2012
  • availability: Available
  • format: Hardback
  • isbn: 9780521802314

£ 69.99
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover parts of this material, none has a similarly wide scope. Ortrud R. Oellermann (Winnipeg), internationally recognised for her substantial contributions to structural graph theory, acted as academic consultant for this volume, helping shape its coverage of key topics. The result is a collection of thirteen expository chapters, each written by acknowledged experts. These contributions have been carefully edited to enhance readability and to standardise the chapter structure, terminology and notation throughout. An introductory chapter details the background material in graph theory and network flows and each chapter concludes with an extensive list of references.

    • Comprehensive coverage of an increasingly important area, written by world leaders in the field
    • Covers the main parts of the subject: connectivity and network algorithms
    • Extensive introductory chapter introduces background material
    Read more

    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: November 2012
    • format: Hardback
    • isbn: 9780521802314
    • length: 342 pages
    • dimensions: 240 x 160 x 22 mm
    • weight: 0.67kg
    • contains: 60 b/w illus.
    • availability: Available
  • Table of Contents

    Foreword Ortrud R. Oellermann
    Preface Lowell W. Beineke and Robin J. Wilson
    Preliminaries Lowell W. Beineke and Robin J. Wilson
    1. Menger's theorem Ortrud R. Oellermann
    2. Maximally connected graphs Dirk Meierling and Lutz Volkmann
    3. Minimal connectivity Matthias Kriesell
    4. Contractions of k-connected graphs Kiyoshi Ando
    5. Connectivity and cycles R. J. Faudree
    6. H-linked graphs Michael Ferrara and Ronald J. Gould
    7. Tree-width and graph minors Dieter Rautenbach and Bruce Reed
    8. Toughness and binding numbers Ian Anderson
    9. Graph fragmentability Keith Edwards and Graham Farr
    10. The phase transition in random graphs Béla Bollobás and Oliver Riordan
    11. Network reliability and synthesis F. T. Boesch, A. Satyanarayana and C. L. Suffel
    12. Connectivity algorithms Abdol-Hossein Esfahanian
    13. Using graphs to find the best block designs R. A. Bailey and Peter J. Cameron
    Notes on contributors
    Index.

  • Editors

    Lowell W. Beineke, Indiana University
    Lowell W. Beineke is Schrey Professor of Mathematics at Indiana University-Purdue University Fort Wayne, where he has been since receiving his Ph.D. from the University of Michigan under the guidance of Frank Harary. His graph theory interests are broad and include topological graph theory, line graphs, tournaments, decompositions and vulnerability. With Robin Wilson he edited Selected Topics in Graph Theory (3 volumes), Applications of Graph Theory, Graph Connections, Topics in Algebraic Graph Theory and Topics in Topological Graph Theory. Until recently he was editor of the College Mathematics Journal.

    Robin J. Wilson, University of Oxford
    Robin J. Wilson is Emeritus Professor of Pure Mathematics at the Open University, UK. He was recently Gresham Professor of Geometry, London and a Fellow in Mathematics at Keble College, University of Oxford, and now teaches at Pembroke College, Oxford. He graduated in mathematics from the University of Oxford and received his Ph.D. in number theory from the University of Pennsylvania. He has written and edited many books on graph theory and the history of mathematics, including Introduction to Graph Theory, Four Colours Suffice and Lewis Carroll in Numberland and his research interests include graph colourings and the history of combinatorics. He is currently President of the British Society for the History of Mathematics.

    Consultant Editor

    Ortrud R. Oellermann, University of Winnipeg, Canada

    Contributors

    Ortrud R. Oellermann, Lowell W. Beineke, Robin J. Wilson, Dirk Meierling, Lutz Volkmann, Matthias Kriesell, Kiyoshi Ando, R. J. Faudree, Michael Ferrara, Ronald J. Gould, Dieter Rautenbach, Bruce Reed, Ian Anderson, Keith Edwards, Graham Farr, Béla Bollobás, Oliver Riordan, F. T. Boesch, A. Satyanarayana, C. L. Suffel, Abdol-Hossein Esfahanian, R. A. Bailey, Peter J. Cameron

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.
×