02110nam a2200289 a 4500001001400000003000700014005001700021008004100038020002900079039004600108040000800154090002000162245008600182260005100268300003400319490006000353504005000413505091700463650003701380650004901417700002301466700002101489830006001510952013101570999002701701999009201728vtls000070718KUKTEM20251125095420.0130605t2013    enka   f      001 0 eng d  a9780521802314 (hardback) 9a201401070942bsainiy201306051441zhairil  aUMP  aQA166 .T67 201300aTopics in structural graph theory /cedited by Lowell W. Beineke, Robin J. Wilson  aCambridge :bCambridge University Press,c2013  axiv, 327 p. :bill. ;c24 cm.1 aEncyclopedia of mathematics and its applications ;v147  aIncludes bibliographical references and index0 aMachine 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 0aGraph theory œx Data processing 7aMATHEMATICS / Discrete Mathematics.2bisacsh1 aBeineke, Lowell W.1 aWilson, Robin J. 0aEncyclopedia of mathematics and its applications ;v147  00104070a20000b20000d2019-09-04g293.05l0oQA166 .T67 2013p0000079701r2019-09-04 00:00:00t1v293.05w2019-09-04yOPEN  aVIRTUA40c71123d71129  aVTLSSORT0080*0200*0400*0900*2450*2600*3000*4900*5040*5050*6500*6501*7000*7001*8300*9992