Graph theory (Record no. 36716)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02812nam a2200373 a 4500 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.5 |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Marcus, Daniel A., |
| 245 10 - TITLE STATEMENT | |
| Title | Graph theory |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Washington, D.C. : |
| Name of publisher | Mathematical Association of America, |
| Year of publication | c2008. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xvi, 205 p. : |
| Other physical details | ill. |
| 500 ## - GENERAL NOTE | |
| General note | Includes index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | "Graph Theory presents a natural, reader-friendly way to learn some of the essential ideas of graph theory starting from first principles. The format is similar to the companion text, Combinatorics: A Problem Oriented Approach also by Daniel A. Marcus, in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of approximately 360 strategically placed problems with connecting text. This is supplemented by 280 additional problems that are intended to be used as homework assignments. Concepts of graph theory are introduced, developed, and reinforced by working through leading questions posed in the problems. This problem-oriented format is intended to promote active involvement by the reader while always providing clear direction. This approach figures prominently on the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear along with concrete examples to keep the readers firmly grounded in their motivation. Spanning tree algorithms, Euler paths, Hamilton paths and cycles, planar graphs, independence and covering, connections and obstructions, and vertex and edge colorings make up the core of the book. Hall's Theorem, the Konig-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optional assignment problem, matrices, and Latin squares are also explored."--Back cover. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Graph theory. |
| Topical Term | Graph theory |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://site.ebrary.com/lib/rucke/Doc?id=10733067 |
No items available.