Graph Theory
A Problem Oriented Approach
£38.99
Part of Mathematical Association of America Textbooks
- Author: Daniel Marcus
- Date Published: August 2008
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Mathematical Association of America for availability.
- format: Hardback
- isbn: 9780883857533
£
38.99
Hardback
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
- Date Published: August 2008
- format: Hardback
- isbn: 9780883857533
- length: 240 pages
- dimensions: 260 x 182 x 16 mm
- weight: 0.55kg
- contains: 640 exercises
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Mathematical Association of America for availability.
Table of Contents
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.
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.
×