Matches in Library of Congress for { <http://lccn.loc.gov/2012022109> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- 2012022109 contributor B12452740.
- 2012022109 created "c2013.".
- 2012022109 date "2013".
- 2012022109 date "c2013.".
- 2012022109 dateCopyrighted "c2013.".
- 2012022109 description "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.".
- 2012022109 extent "xiv, 327p. :".
- 2012022109 identifier "9780521802314 (hardback)".
- 2012022109 identifier 9780521802314.jpg.
- 2012022109 isPartOf "Encyclopedia of mathematics and its applications ; 147".
- 2012022109 issued "2013".
- 2012022109 issued "c2013.".
- 2012022109 language "eng".
- 2012022109 publisher "New York : Cambridge University Press,".
- 2012022109 subject "511/.5 23".
- 2012022109 subject "Graph theory Data processing.".
- 2012022109 subject "MATHEMATICS / Discrete Mathematics. bisacsh".
- 2012022109 subject "QA166 .T645 2013".
- 2012022109 tableOfContents "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.".
- 2012022109 title "Topics in structural graph theory / edited by Lowell W. Beineke, Robin J. Wilson.".
- 2012022109 type "text".
