Introduction to graph theory / (Record no. 139)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01660cam a2200217 a 4500 |
| 001 - CONTROL NUMBER | |
| control field | 902 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20210113113334.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 000413s2001 njua b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9788178088303 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | DLC |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511/.5 |
| Edition number | 21 |
| Item number | W5161 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | West, Douglas Brent. |
| 245 10 - TITLE STATEMENT | |
| Title | Introduction to graph theory / |
| Statement of responsibility, etc | Douglas B. West. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc | New Dehli : |
| Name of publisher, distributor, etc | Pearson , |
| Date of publication, distribution, etc | 2001 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xix, 588 p. |
| Other physical details | ill. ; |
| Dimensions | 25 cm. |
| 500 ## - GENERAL NOTE | |
| General note | Includes bibliographical references (p. 537-568) and indexes. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Graph theory. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Books |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1. Ch. 1. Fundamental concepts: What is a graph? ;<br/>2. Paths, cycles, and trails ;<br/>3. Vertex degrees and counting ;<br/>4. Directed graphs ;<br/>5. Ch. 2. Trees and distance: Basic properties ;<br/>6. Spanning trees and enumeration ;<br/>7. Optimization and trees ;<br/>8. Ch. 3. Matchings and factors: Matchings and covers ;<br/>9. Algorithms and applications ;<br/>10. Matchings in general graphs ;<br/>11. Ch. 4. Connectivity and paths: Cuts and connectivity ;<br/>12. K-connected graphs ;<br/>13. Network flow problems ;<br/>14. Ch. 5. Coloring of graphs: Vertex colorings and upper bounds ;<br/>15. Structure of k-chromatic graphs ;<br/>16. Enumerative aspects ;<br/>17. Ch. 6. Planar graphs: Embeddings and Euler's formula ;<br/>18. Characterization of Planar graphs ;<br/>19. Parameters of planarity ;<br/>20. Ch. 7. Edges and cycles: Line graphs and edge-coloring ;<br/>21. Hamiltonion cycles ;<br/>22. Planarity, coloring, and cycles ;<br/>23. Ch. 8. Additional topics (optional): Perfect graphs ;<br/>24. Matroids ;<br/>25. Ramsey theory ;<br/>26. More extremeal problems ;<br/>27. Random graphs ;<br/>28. Eigenvalues of graphs.<br/> |
| Withdrawn status | Damaged status | Not for loan | Home library | Current library | Date acquired | Source of acquisition | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|
| UE-Central Library | UE-Central Library | 22.05.2018 | U.E. | 511.5 W5161 | T902 | 12.11.2024 | 22.05.2018 | Books |
