Graph Theory : A Problem Oriented Approach
Saved in:
| Title: | Graph Theory : A Problem Oriented Approach |
|---|---|
| Description: | 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 (MAA 1998), in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of strategically placed problems with connecting text. This is supplemented by 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 three 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 König-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optimal assignment problem, matrices and latin squares are also explored. |
| Authors: | Marcus, Daniel A., Mathematical Association of America |
| Resource Type: | eBook. |
| Subjects: | Graph theory--Problems, exercises, etc, Graph theory |
| Categories: | MATHEMATICS / Graphic Methods |
| Database: | eBook Collection (EBSCOhost) |
| Abstract: | 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 (MAA 1998), in that it combines the features of a textbook with those of a problem workbook. The material is presented through a series of strategically placed problems with connecting text. This is supplemented by 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 three 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 König-Egervary Theorem, Dilworth's Theorem and the Hungarian algorithm to the optimal assignment problem, matrices and latin squares are also explored. |
|---|---|
| ISBN: | 9780883857755 9780883859698 |
