9780131437371

Introduction to Graph Theory (Classic Version)

by
  • ISBN13:

    9780131437371

  • ISBN10:

    0131437372

  • Edition: 2nd
  • Format: Paperback
  • Copyright: 2017-02-14
  • Publisher: Pearson

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $26.88
    Check/Direct Deposit: $25.60
List Price: $99.97 Save up to $64.98
  • Rent Book $34.99
    Add to Cart Free Shipping

    TERM
    PRICE
    DUE

Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Summary

This book fills a need for a thorough introduction to graph theory that features both the understanding and writing of proofs about graphs. Verification that algorithms work is emphasized more than their complexity.An effective use of examples, and huge number of interesting exercises, demonstrate the topics of trees and distance, matchings and factors, connectivity and paths, graph coloring, edges and cycles, and planar graphs.For those who need to learn to make coherent arguments in the fields of mathematics and computer science.

Table of Contents



1. 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.

Rewards Program

Write a Review