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.
Inhaltsangabe
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.
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.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309
