Graph Theory
A Problem Oriented Approach
Seiten
2008
Mathematical Association of America (Verlag)
978-0-88385-753-3 (ISBN)
Mathematical Association of America (Verlag)
978-0-88385-753-3 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
Combining the features of a textbook with those of a problem workbook, the material is presented through 360 strategically placed problems explained with helpful notes. Concepts of graph theory are introduced, developed and reinforced by working through these problems, encouraging readers to get actively involved.
Combining the features of a textbook with those of a problem workbook, this text for mathematics, computer science and engineering students presents a natural, friendly way to learn some of the essential ideas of graph theory. The material is explained using 360 strategically placed problems with connecting text, which is then supplemented by 280 additional homework problems. This problem-oriented format encourages active involvement by the reader while always giving clear direction. This approach is especially valuable with the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear together with concrete examples to help remind the reader of the bigger picture. Topics include spanning tree algorithms, Euler paths, Hamilton paths and cycles, independence and covering, connections and obstructions, and vertex and edge colourings.
Combining the features of a textbook with those of a problem workbook, this text for mathematics, computer science and engineering students presents a natural, friendly way to learn some of the essential ideas of graph theory. The material is explained using 360 strategically placed problems with connecting text, which is then supplemented by 280 additional homework problems. This problem-oriented format encourages active involvement by the reader while always giving clear direction. This approach is especially valuable with the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear together with concrete examples to help remind the reader of the bigger picture. Topics include spanning tree algorithms, Euler paths, Hamilton paths and cycles, independence and covering, connections and obstructions, and vertex and edge colourings.
Daniel A. Marcus was Professor of Mathematics at California State Polytechnic University, Pomona.
Preface; A. Basic Concepts; B. Isomorphic graphs; C. Bipartite graphs; D. Trees and forests; E. Spanning tree algorithms; F. Euler paths; G. Hamilton paths and cycles; H. Planar graphs; I. Independence and covering; J. Connections and obstructions; K. Vertex coloring; L. Edge coloring; M. Matching theory for bipartite graphs; N. Applications of matching theory; O. Cycle-Free digraphs; Answers to selected problems.
| Erscheint lt. Verlag | 21.8.2008 |
|---|---|
| Reihe/Serie | Mathematical Association of America Textbooks |
| Zusatzinfo | Worked examples or Exercises |
| Verlagsort | Washington |
| Sprache | englisch |
| Maße | 182 x 260 mm |
| Gewicht | 550 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-88385-753-7 / 0883857537 |
| ISBN-13 | 978-0-88385-753-3 / 9780883857533 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95
