|
![]() |
|||
|
||||
OverviewFor undergraduate or graduate courses in Graph Theory in departments of mathematics or computer science. This text offers a comprehensive and coherent introduction to the fundamental topics of graph theory. It includes basic algorithms and emphasizes the understanding and writing of proofs about graphs. Thought-provoking examples and exercises develop a thorough understanding of the structure of graphs and the techniques used to analyze problems. Appendix of Mathematical Background - Appendix A presents background material on logical statements, basic set theory, equivalence relations, and elementary counting. Expanded and improved selection of 1,000 exercises. Full Product DetailsAuthor: Douglas B. WestPublisher: Pearson Education (US) Imprint: Pearson Edition: 2nd edition Dimensions: Width: 18.40cm , Height: 3.60cm , Length: 23.70cm Weight: 1.118kg ISBN: 9780130144003ISBN 10: 0130144002 Pages: 470 Publication Date: 04 September 2000 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Out of Print Availability: In Print ![]() Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock. Table of Contents1. Fundamental Concepts. What Is a Graph? Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs. 2. Trees and Distance. Basic Properties. Spanning Trees and Enumeration. Optimization and Trees. 3. Matchings and Factors. Matchings and Covers. Algorithms and Applications. Matchings in General Graphs. 4. Connectivity and Paths. Cuts and Connectivity. k-connected Graphs. Network Flow Problems. 5. Coloring of Graphs. Vertex Colorings and Upper Bounds. Structure of k-chromatic Graphs. Enumerative Aspects. 6. Planar Graphs. Embeddings and Euler's Formula. Characterization of Planar Graphs. Parameters of Planarity. 7. Edges and Cycles. Line Graphs and Edge-Coloring. Hamiltonian Cycles. Planarity, Coloring, and Cycles. 8. Additional Topics (Optional). Perfect Graphs. Matroids. Ramsey Theory. More Extremal Problems. Random Graphs. Eigenvalues of Graphs. Appendix A: Mathematical Background. Appendix B: Optimization and Complexity. Appendix C: Hints for Selected Exercises. Appendix D: Glossary of Terms. Appendix E: Supplemental Reading. Appendix F: References. Indices.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |