Graph Theory
A Problem Oriented Approach
Daniel A. Marcus(Author)
Mathematical Association of America (Publisher)
2nd Edition
Published on 13. August 2015
Book
Paperback/Softback
218 pages
978-0-88385-772-4 (ISBN)
Description
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.
Reviews / Votes
This work could be the basis for a very nice one-semester ""transition"" course in which students evolve from users of theorems to creators of proofs. With their intuitive appeal and pictorial representations, graphs may be a better basis than analysis and limits for such a transtion."" - ChoiceMore details
Edition
2nd Revised edition
Language
English
Place of publication
Washington
United States
Target group
College/higher education
Edition type
Revised edition
Product notice
Paperback (trade)
Dimensions
Height: 254 mm
Width: 179 mm
Thickness: 15 mm
Weight
407 gr
ISBN-13
978-0-88385-772-4 (9780883857724)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Previous edition

Book
08/2008
Mathematical Association of America
€68.27
Article exhausted; check for reprint
Person
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.
Content
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.