Für diesen Artikel ist leider kein Bild verfügbar.

Graph Theory

A Problem Oriented Approach
Buch | Softcover
218 Seiten
2015 | 2nd Revised edition
Mathematical Association of America (Verlag)
978-0-88385-772-4 (ISBN)
46,10 inkl. MwSt
  • Keine Verlagsinformationen verfügbar
  • Artikel merken
Combining the features of a textbook with those of a problem workbook, this text presents a natural, friendly way to learn some of the essential ideas of graph theory, with 360 strategically placed exercises and 280 additional homework problems to encourage reader involvement and engagement.
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 received his PhD from Harvard University. He was a J. Willard Gibbs Instructor at Yale University from 1972 to 1974 and Professor of Mathematics at California State Polytechnic University, Pomona, from 1979 to 2004.

Preface; 1. Introduction: problems of graph theory; 2. Basic concepts; 3. Isomorphic graphs; 4. Bipartite graphs; 5. Trees and forests; 6. Spanning tree algorithms; 7. Euler paths; 8. Hamilton paths and cycles; 9. Planar graphs; 10. Independence and covering; 11. Connections and obstructions; 12. Vertex coloring; 13. Edge coloring; 14. Matching theory for bipartite graphs; 15. Applications of matching theory; 16. Cycle-free digraphs; 17. Network flow theory; 18. Flow problems with lower bounds; Answers to selected problems; Index; About the author.

Verlagsort Washington
Sprache englisch
Maße 179 x 253 mm
Gewicht 410 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-88385-772-3 / 0883857723
ISBN-13 978-0-88385-772-4 / 9780883857724
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
64,95