Description

For undergraduate or graduate courses in Graph Theory in departments of mathematics or computer science.

This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price. 

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. The first seven chapters form the basic course, with advanced material in Chapter 8.

Features

Hallmark features of this title

• Logical organization: Concepts are introduced as needed, achieving a gradual increase in intellectual difficulty.
• Additional topic: Final chapter is a bridge to advanced topics.
• Over 400 illustrations.
• Over 1200 exercises ranging from relatively straightforward applications of ideas in the text to subtle problems requiring some ingenuity.
• Graduation of exercises denotes easier exercises by (-), harder by (+), and particularly valuable or instinctive exercises by (!).

New to this Edition

New and updated features of this title

• 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 exercises: Exercises have been added, especially easier exercises, and many exercises have been further clarified.
• Reorganization of material: Some material has been reorganized to provide a smoother development and clearer focus on essential material with optional material clearly designated or removed.
• Definitions are more prominent. Terms being defined are in bold type and most important definitions occur in numbered items.
• Hints for selected exercises: More hints have been added as Appendix C.

Table of Contents

• 1. Fundamental Concepts
• 2. Trees and Distance
• 3. Matchings and Factors
• 4. Connectivity and Paths
• 5. Coloring of Graphs
• 6. Planar Graphs.
• 7. Edges and Cycles
• 8. Additional Topics (Optional)
• 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