Topics in Structural Graph Theory
Part of Encyclopedia of Mathematics and its Applications
 Editors:
 Lowell W. Beineke, Indiana University
 Robin J. Wilson, University of Oxford
 Date Published: November 2012
 availability: Available
 format: Hardback
 isbn: 9780521802314
Hardback
Other available formats:
eBook
Looking for an evaluation copy?
This title is not currently available for evaluation. However, if you are interested in the title for your course we can consider offering an evaluation copy. To register your interest please contact asiamktg@cambridge.org providing details of the course you are teaching.

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.
Read more 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×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 kconnected graphs Kiyoshi Ando
5. Connectivity and cycles R. J. Faudree
6. Hlinked graphs Michael Ferrara and Ronald J. Gould
7. Treewidth 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 AbdolHossein Esfahanian
13. Using graphs to find the best block designs R. A. Bailey and Peter J. Cameron
Notes on contributors
Index.
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» Proceed