TY  - BOOK
AU  - Beineke,Lowell W.
AU  - Wilson,Robin J.
TI  - Topics in structural graph theory /edited by Lowell W. Beineke, Robin J. Wilson
T2  - Encyclopedia of mathematics and its applications
SN  - 9781107249813
AV  - QA166 .T675 2013
PY  - 2013///
CY  - New York
PB  - Cambridge University Press
KW  - Graph theory
KW  - Data processing
KW  - Electronic Books
N1  - 2; Preliminaries; Lowell W. Beineke and Robin J. Wilson --; Menger's theorem; Ortrud O. Oellermann --; Maximally connected graphs; Dirk Meierling and Lutz Volkmann --; Minimal connectivity; Matthias Kriesell --; Contractions of k-connected graphs; Kiyoshi Ando --; Connectivity and cycles; R.J. Faudree --; H-linked graphs; Michael Ferrara and Ronald J. Gould --; Tree-width and graph minors; Dieter Rautenbach and Bruce Reed --; Toughness and binding numbers; Ian Anderson --; Graph fragmentability; Keith Edwards and Graham Farr --; The phase transition in random graphs; Béla Bollobás and Oliver Riordan --; Network reliability and synthesis; F.T. Boesch, A. Satyanarayana and C.L. Suffel --; Connectivity algorithms; Abdol-Hossein Esfahanian --; Using graphs to find the best block designs; R.A. Bailey and Peter J. Cameron; 2; b
N2  - "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"--
UR  - https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=574827&site=eds-live&custid=s3260518
ER  -