MARC details
| 000 -LEADER |
| fixed length control field |
01966nam a2200277 a 4500 |
| 001 - CONTROL NUMBER |
| control field |
vtls000070718 |
| 003 - CONTROL NUMBER IDENTIFIER |
| control field |
KUKTEM |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
| control field |
20251125095420.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
| fixed length control field |
130605t2013 enka f 001 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
| International Standard Book Number |
9780521802314 (hardback) |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
| Level of rules in bibliographic description |
201401070942 |
| Level of effort used to assign nonsubject heading access points |
saini |
| -- |
201306051441 |
| -- |
hairil |
| 040 ## - CATALOGING SOURCE |
| Original cataloging agency |
UMP |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA166 .T67 2013 |
| 245 00 - TITLE STATEMENT |
| Title |
Topics in structural graph theory / |
| Statement of responsibility, etc. |
edited by Lowell W. Beineke, Robin J. Wilson |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
| Place of publication, distribution, etc. |
Cambridge : |
| Name of publisher, distributor, etc. |
Cambridge University Press, |
| Date of publication, distribution, etc. |
2013 |
| 300 ## - PHYSICAL DESCRIPTION |
| Extent |
xiv, 327 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 490 1# - SERIES STATEMENT |
| Series statement |
Encyclopedia of mathematics and its applications ; |
| Volume/sequential designation |
147 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
| Bibliography, etc. note |
Includes bibliographical references and index |
| 505 0# - FORMATTED CONTENTS NOTE |
| Formatted contents note |
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 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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
| Topical term or geographic name entry element |
Graph theory x Data processing |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM |
| Topical term or geographic name entry element |
MATHEMATICS / Discrete Mathematics. |
| Source of heading or term |
bisacsh |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
| Personal name |
Beineke, Lowell W. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
| Personal name |
Wilson, Robin J. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
| Uniform title |
Encyclopedia of mathematics and its applications ; |
| Volume/sequential designation |
147 |