Graph Theory
A Problem Oriented Approach
2nd Edition
- Author: Daniel A. Marcus
- Date Published: August 2015
- availability: Temporarily unavailable - available from TBC
- format: Paperback
- isbn: 9780883857724
Paperback
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- Introduces graph theory using 360 explanatory exercises, with a further 280 homework problems to help students master the concepts
- Topics include Hall's Theorem, the Konig–Egervary Theorem, matrices and Latin squares
- Ideal for undergraduates in mathematics, computer science and engineering
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Edition: 2nd Edition
- Date Published: August 2015
- format: Paperback
- isbn: 9780883857724
- length: 218 pages
- dimensions: 253 x 179 x 13 mm
- weight: 0.41kg
- availability: Temporarily unavailable - available from TBC
Table of Contents
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.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×