MOMENTAN AUSVERKAUFT
Über dieses Produkt
Product Identifiers
PublisherAmerican Mathematical Society
ISBN-100883857723
ISBN-139780883857724
eBay Product ID (ePID)109002771
Product Key Features
Number of Pages220 Pages
Publication NameGraph Theory : a Problem Oriented Approach
LanguageEnglish
Publication Year2015
SubjectGraphic Methods, Discrete Mathematics
TypeTextbook
Subject AreaMathematics
AuthorDaniel A. Marcus
FormatTrade Paperback
Dimensions
Item Height0.5 in
Item Weight14.4 Oz
Item Length10 in
Item Width7 in
Additional Product Features
Edition Number2
Intended AudienceCollege Audience
ReviewsThis 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."" - Choice
Dewey Edition22
IllustratedYes
Dewey Decimal511.5
Table Of ContentPreface; 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.
SynopsisCombining 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.
LC Classification NumberQA166
