Introduction to Graph Theory [5 ed.] 9780273728894
In recent years graph theory has emerged as a subject in its own right, as well as being an important mathematical tool
1,033 164 5MB
English Pages 184 [193] Year 2010
Table of contents :
Cover
Contents
Preface
Introduction
Chapter 1 - Definitions and Examples
1.1 - Definitions
1.2 - Examples
1.3 - Variations on a theme
1.4 - Three puzzles
Chapter 2 - Paths and Cycles
2.1 - Connectivity
2.2 - Eulerian graphs and digraphs
2.3 - Hamiltonian graphs and digraphs
2.4 - Applications
Chapter 3 - Trees
3.1 - Properties of trees
3.2 - Counting trees
3.3 - More applications
Chapter 4 - Planarity
4.1 - Planar graphs
4.2 - Euler's formula
4.3 - Dual graphs
4.4 - Graphs on other surfaces
Chapter 5 - Colouring Graphs
5.1 - Colouring vertices
5.2 - Chromatic polynomials
5.3 - Colouring maps
5.4 - The four-color theorem
5.5 - Colouring edges
Chapter 6 - Matching, Marriage, and Menger's Theorem
6.1 - Hall's 'marriage' theorem
6.2 - Menger's theorem
6.3 - Network flows
Chapter 7 - Matroids
7.1 - Introduction to matroids
7.2 - Examples of matroids
7.3 - Matroids and graphs
Appendix 1: Algorithms
Appendix 2: Table of numbers
List of symbols
Bibliography
Solutions to Selected Exercises
Introduction
Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Index
Cover
Contents
Preface
Introduction
Chapter 1 - Definitions and Examples
1.1 - Definitions
1.2 - Examples
1.3 - Variations on a theme
1.4 - Three puzzles
Chapter 2 - Paths and Cycles
2.1 - Connectivity
2.2 - Eulerian graphs and digraphs
2.3 - Hamiltonian graphs and digraphs
2.4 - Applications
Chapter 3 - Trees
3.1 - Properties of trees
3.2 - Counting trees
3.3 - More applications
Chapter 4 - Planarity
4.1 - Planar graphs
4.2 - Euler's formula
4.3 - Dual graphs
4.4 - Graphs on other surfaces
Chapter 5 - Colouring Graphs
5.1 - Colouring vertices
5.2 - Chromatic polynomials
5.3 - Colouring maps
5.4 - The four-color theorem
5.5 - Colouring edges
Chapter 6 - Matching, Marriage, and Menger's Theorem
6.1 - Hall's 'marriage' theorem
6.2 - Menger's theorem
6.3 - Network flows
Chapter 7 - Matroids
7.1 - Introduction to matroids
7.2 - Examples of matroids
7.3 - Matroids and graphs
Appendix 1: Algorithms
Appendix 2: Table of numbers
List of symbols
Bibliography
Solutions to Selected Exercises
Introduction
Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Index
![Introduction to Graph Theory [5 ed.]
9780273728894](https://ebin.pub/img/200x200/introduction-to-graph-theory-5nbsped-9780273728894.jpg)
![Introduction to Graph Theory [2 ed.]
0130144002, 9780130144003, 8178088304](https://ebin.pub/img/200x200/introduction-to-graph-theory-2nbsped-0130144002-9780130144003-8178088304.jpg)
![Introduction to Graph Theory [2 ed.]
8178088304](https://ebin.pub/img/200x200/introduction-to-graph-theory-2nbsped-8178088304.jpg)
![Graph Theory: An Introduction to Proofs, Algorithms, and Applications [1 ed.]
1138361402, 9781138361409](https://ebin.pub/img/200x200/graph-theory-an-introduction-to-proofs-algorithms-and-applications-1nbsped-1138361402-9781138361409.jpg)
![Introduction to Graph Signal Processing [1 ed.]
1108428134, 9781108428132](https://ebin.pub/img/200x200/introduction-to-graph-signal-processing-1nbsped-1108428134-9781108428132.jpg)