01966nam a2200277 a 4500 vtls000070718 KUKTEM 20251125095420.0 130605t2013 enka f 001 0 eng d 9780521802314 (hardback) 201401070942 saini 201306051441 hairil UMP QA166 .T67 2013 Topics in structural graph theory / edited by Lowell W. Beineke, Robin J. Wilson Cambridge : Cambridge University Press, 2013 xiv, 327 p. : ill. ; 24 cm. Encyclopedia of mathematics and its applications ; 147 Includes bibliographical references and index Machine generated contents note: Foreword Ortrud R. Oellermann; Preliminaries Lowell W. Beineke and Robin J. Wilson; 1. Menger’s theorem Ortrud O. Oellermann; 2. Maximal connectivity 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 number Ian Anderson; 9. Graph fragmentability Keith Edwards and Graham Farr; 10. The phase transition in random graphs Bela 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 Graph theory œx Data processing MATHEMATICS / Discrete Mathematics. bisacsh Beineke, Lowell W. Wilson, Robin J. Encyclopedia of mathematics and its applications ; 147 0 0 0 0 20000 20000 2019-09-04 293.05 0 QA166 .T67 2013 0000079701 2019-09-04 00:00:00 1 293.05 2019-09-04 OPEN VIRTUA40 71123 71129 VTLSSORT0080*0200*0400*0900*2450*2600*3000*4900*5040*5050*6500*6501*7000*7001*8300*9992