
- English
- PDF
- Available on iOS & Android
Topics in Structural Graph Theory
About this book
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.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Topics in Structural Graph Theory
- Series Page
- Title
- Copyright
- Contents
- Foreword
- Preface
- Preliminaries
- 1 Menger's theorem
- 2 Maximally connected graphs
- 3 Minimal connectivity
- 4 Contractions of k-connected graphs
- 5 Connectivity and cycles
- 6 H-linked graphs
- 7 Tree-width and graph minors
- 8 Toughness and binding numbers
- 9 Graph fragmentability
- 10 The phase transition in random graphs
- 11 Network reliability and synthesis
- 12 Connectivity algorithms
- 13 Using graphs to find the best block designs
- Notes on contributors
- Index