| 000 | 02589nam a2200301 a 4500 | ||
|---|---|---|---|
| 001 | vtls000035779 | ||
| 003 | KUKTEM | ||
| 005 | 20251117150435.0 | ||
| 008 | 090430t2008 waua f 000 0 eng d | ||
| 020 | _a9780883857533 | ||
| 020 | _a0883857537 | ||
| 039 | 9 |
_a201107132137 _bVLOAD _c200911241002 _dfauzi _c200908141608 _dVLOAD _c200908141540 _dVLOAD _y200904301038 _zsaini |
|
| 040 | _aUMP | ||
| 090 | _aQA166 .M37 2008 | ||
| 100 | 1 | _aMarcus, Daniel A. | |
| 245 | 1 | 0 |
_aGraph theory : _ba problem oriented approach / _cDaniel A. Marcus |
| 260 |
_aWashington, D.C. : _bMathematical Association of America, _cc2008 |
||
| 300 |
_axvi, 205 p. : _bill.; _c26 cm. |
||
| 490 | 1 | _aMAA textbooks | |
| 500 | _aIncludes index | ||
| 520 | _a"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 | _aGraph theory | |
| 650 | 0 |
_aGraph theory _vProblems, exercises, etc. |
|
| 710 | 2 | _aMathematical Association of America | |
| 830 | 0 | _aMAA textbooks | |
| 856 | 4 | 1 |
_3Table of contents only _uhttp://www.loc.gov/catdir/enhancements/fy0902/2008922013-t.html |
| 999 |
_aVIRTUA40 _c58395 _d58401 |
||
| 999 | _aVTLSSORT0080*0200*0201*0400*0900*1000*2450*2600*3000*4900*5000*5200*6500*6501*7100*8300*8560*9991 | ||