Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Fundamentals of Graph Theory
 
Allan Bickle Pennsylvania State University Altoona, Altoona, PA
Fundamentals of Graph Theory
Hardcover ISBN:  978-1-4704-5342-8
Product Code:  AMSTEXT/43
List Price: $85.00
MAA Member Price: $76.50
AMS Member Price: $68.00
eBook ISBN:  978-1-4704-5549-1
Product Code:  AMSTEXT/43.E
List Price: $85.00
MAA Member Price: $76.50
AMS Member Price: $68.00
Hardcover ISBN:  978-1-4704-5342-8
eBook: ISBN:  978-1-4704-5549-1
Product Code:  AMSTEXT/43.B
List Price: $170.00 $127.50
MAA Member Price: $153.00 $114.75
AMS Member Price: $136.00 $102.00
Fundamentals of Graph Theory
Click above image for expanded view
Fundamentals of Graph Theory
Allan Bickle Pennsylvania State University Altoona, Altoona, PA
Hardcover ISBN:  978-1-4704-5342-8
Product Code:  AMSTEXT/43
List Price: $85.00
MAA Member Price: $76.50
AMS Member Price: $68.00
eBook ISBN:  978-1-4704-5549-1
Product Code:  AMSTEXT/43.E
List Price: $85.00
MAA Member Price: $76.50
AMS Member Price: $68.00
Hardcover ISBN:  978-1-4704-5342-8
eBook ISBN:  978-1-4704-5549-1
Product Code:  AMSTEXT/43.B
List Price: $170.00 $127.50
MAA Member Price: $153.00 $114.75
AMS Member Price: $136.00 $102.00
  • Book Details
     
     
    Pure and Applied Undergraduate Texts
    Volume: 432020; 336 pp
    MSC: Primary 05

    Graph theory is a fascinating and inviting branch of mathematics. Many problems are easy to state and have natural visual representations, inviting exploration by new students and professional mathematicians. The goal of this textbook is to present the fundamentals of graph theory to a wide range of readers. The book contains many significant recent results in graph theory, presented using up-to-date notation. The author included the shortest, most elegant, most intuitive proofs for modern and classic results while frequently presenting them in new ways. Major topics are introduced with practical applications that motivate their development, and which are illustrated with examples that show how to apply major theorems in practice. This includes the process of finding a brute force solution (case-checking) when an elegant solution is not apparent. With over 1200 exercises, internet resources (e.g., the OEIS for counting problems), helpful appendices, and a detailed guide to different course outlines, this book provides a versatile and convenient tool for the needs of instructors at a large variety of institutions.

    Readership

    Undergraduate and graduate students interested in graph theory.

  • Table of Contents
     
     
    • Cover
    • Preface
    • Chapter 1. Basics of Graphs
    • 1.1. Graphs as Models
    • 1.2. Representations of Graphs
    • 1.3. Graph Parameters
    • 1.4. Common Graph Classes
    • 1.5. Graph Operations
    • 1.6. Distance
    • 1.7. Bipartite Graphs
    • 1.8. Generalizations of Graphs
    • Exercises
    • Chapter 2. Trees and Connectivity
    • 2.1. Trees
    • 2.2. Tree Algorithms
    • 2.3. Connectivity
    • 2.4. Menger’s Theorem
    • Exercises
    • Chapter 3. Structure and Degrees
    • 3.1. Eulerian Graphs
    • 3.2. Graph Isomorphism
    • 3.3. Degree Sequences
    • 3.4. Degeneracy
    • Exercises
    • Chapter 4. Vertex Coloring
    • 4.1. Applications of Coloring
    • 4.2. Coloring Bounds
    • 4.3. Coloring and Operations
    • 4.4. Extremal 𝑘-chromatic Graphs
    • 4.5. Perfect Graphs
    • Exercises
    • Chapter 5. Planarity
    • 5.1. The Four Color Theorem
    • 5.2. Planar Graphs
    • 5.3. Kuratowski’s Theorem
    • 5.4. Dual Graphs and Geometry
    • 5.5. Genus of Graphs
    • Exercises
    • Chapter 6. Hamiltonian Graphs
    • 6.1. Finding Hamiltonian Cycles
    • 6.2. Hamiltonian Applications
    • 6.3. Hamiltonian Planar Graphs
    • 6.4. Tournaments
    • Exercises
    • Chapter 7. Matchings
    • 7.1. Bipartite Matchings
    • 7.2. Tutte’s 1-Factor Theorem
    • 7.3. Edge Coloring
    • 7.4. Tait Coloring
    • 7.5. Domination
    • Exercises
    • Chapter 8. Generalized Graph Colorings
    • 8.1. List Coloring
    • 8.2. Vertex Arboricity
    • 8.3. Grundy Numbers
    • 8.4. Distance and Sets
    • Exercises
    • Chapter 9. Decompositions
    • 9.1. Decomposing Complete Graphs
    • 9.2. General Decompositions
    • 9.3. Ramsey Numbers
    • 9.4. Nordhaus-Gaddum Theorems
    • Exercises
    • Chapter 10. Appendices
    • 10.1. Proofs
    • 10.2. Counting Techniques and Identities
    • 10.3. Computational Complexity
    • 10.4. Bounds and Extremal Graphs
    • 10.5. Graph Characterizations
    • Nomenclature
    • Bibliography
    • Index
    • Back Cover
  • Reviews
     
     
    • ...this is an attractive new addition to the upper-level undergraduate textbook literature on graph theory, and anybody planning to teach such a course should certainly make its acquaintance, as should anyone who wants a good graph theory reference. I'm glad it's on my shelf.

      Mark Hunacek, Iowa State University
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Desk Copy – for instructors who have adopted an AMS textbook for a course
    Examination Copy – for faculty considering an AMS textbook for a course
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 432020; 336 pp
MSC: Primary 05

Graph theory is a fascinating and inviting branch of mathematics. Many problems are easy to state and have natural visual representations, inviting exploration by new students and professional mathematicians. The goal of this textbook is to present the fundamentals of graph theory to a wide range of readers. The book contains many significant recent results in graph theory, presented using up-to-date notation. The author included the shortest, most elegant, most intuitive proofs for modern and classic results while frequently presenting them in new ways. Major topics are introduced with practical applications that motivate their development, and which are illustrated with examples that show how to apply major theorems in practice. This includes the process of finding a brute force solution (case-checking) when an elegant solution is not apparent. With over 1200 exercises, internet resources (e.g., the OEIS for counting problems), helpful appendices, and a detailed guide to different course outlines, this book provides a versatile and convenient tool for the needs of instructors at a large variety of institutions.

Readership

Undergraduate and graduate students interested in graph theory.

  • Cover
  • Preface
  • Chapter 1. Basics of Graphs
  • 1.1. Graphs as Models
  • 1.2. Representations of Graphs
  • 1.3. Graph Parameters
  • 1.4. Common Graph Classes
  • 1.5. Graph Operations
  • 1.6. Distance
  • 1.7. Bipartite Graphs
  • 1.8. Generalizations of Graphs
  • Exercises
  • Chapter 2. Trees and Connectivity
  • 2.1. Trees
  • 2.2. Tree Algorithms
  • 2.3. Connectivity
  • 2.4. Menger’s Theorem
  • Exercises
  • Chapter 3. Structure and Degrees
  • 3.1. Eulerian Graphs
  • 3.2. Graph Isomorphism
  • 3.3. Degree Sequences
  • 3.4. Degeneracy
  • Exercises
  • Chapter 4. Vertex Coloring
  • 4.1. Applications of Coloring
  • 4.2. Coloring Bounds
  • 4.3. Coloring and Operations
  • 4.4. Extremal 𝑘-chromatic Graphs
  • 4.5. Perfect Graphs
  • Exercises
  • Chapter 5. Planarity
  • 5.1. The Four Color Theorem
  • 5.2. Planar Graphs
  • 5.3. Kuratowski’s Theorem
  • 5.4. Dual Graphs and Geometry
  • 5.5. Genus of Graphs
  • Exercises
  • Chapter 6. Hamiltonian Graphs
  • 6.1. Finding Hamiltonian Cycles
  • 6.2. Hamiltonian Applications
  • 6.3. Hamiltonian Planar Graphs
  • 6.4. Tournaments
  • Exercises
  • Chapter 7. Matchings
  • 7.1. Bipartite Matchings
  • 7.2. Tutte’s 1-Factor Theorem
  • 7.3. Edge Coloring
  • 7.4. Tait Coloring
  • 7.5. Domination
  • Exercises
  • Chapter 8. Generalized Graph Colorings
  • 8.1. List Coloring
  • 8.2. Vertex Arboricity
  • 8.3. Grundy Numbers
  • 8.4. Distance and Sets
  • Exercises
  • Chapter 9. Decompositions
  • 9.1. Decomposing Complete Graphs
  • 9.2. General Decompositions
  • 9.3. Ramsey Numbers
  • 9.4. Nordhaus-Gaddum Theorems
  • Exercises
  • Chapter 10. Appendices
  • 10.1. Proofs
  • 10.2. Counting Techniques and Identities
  • 10.3. Computational Complexity
  • 10.4. Bounds and Extremal Graphs
  • 10.5. Graph Characterizations
  • Nomenclature
  • Bibliography
  • Index
  • Back Cover
  • ...this is an attractive new addition to the upper-level undergraduate textbook literature on graph theory, and anybody planning to teach such a course should certainly make its acquaintance, as should anyone who wants a good graph theory reference. I'm glad it's on my shelf.

    Mark Hunacek, Iowa State University
Review Copy – for publishers of book reviews
Desk Copy – for instructors who have adopted an AMS textbook for a course
Examination Copy – for faculty considering an AMS textbook for a course
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
You may be interested in...
Please select which format for which you are requesting permissions.