| 000 | 01966nam a2200277 a 4500 | ||
|---|---|---|---|
| 001 | vtls000070718 | ||
| 003 | KUKTEM | ||
| 005 | 20251125095420.0 | ||
| 008 | 130605t2013 enka f 001 0 eng d | ||
| 020 | _a9780521802314 (hardback) | ||
| 039 | 9 |
_a201401070942 _bsaini _y201306051441 _zhairil |
|
| 040 | _aUMP | ||
| 090 | _aQA166 .T67 2013 | ||
| 245 | 0 | 0 |
_aTopics in structural graph theory / _cedited by Lowell W. Beineke, Robin J. Wilson |
| 260 |
_aCambridge : _bCambridge University Press, _c2013 |
||
| 300 |
_axiv, 327 p. : _bill. ; _c24 cm. |
||
| 490 | 1 |
_aEncyclopedia of mathematics and its applications ; _v147 |
|
| 504 | _aIncludes bibliographical references and index | ||
| 505 | 0 | _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 BollobaÌ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 | |
| 650 | 0 | _aGraph theory x Data processing | |
| 650 | 7 |
_aMATHEMATICS / Discrete Mathematics. _2bisacsh |
|
| 700 | 1 | _aBeineke, Lowell W. | |
| 700 | 1 | _aWilson, Robin J. | |
| 830 | 0 |
_aEncyclopedia of mathematics and its applications ; _v147 |
|
| 999 |
_aVIRTUA40 _c71123 _d71129 |
||
| 999 | _aVTLSSORT0080*0200*0400*0900*2450*2600*3000*4900*5040*5050*6500*6501*7000*7001*8300*9992 | ||