| |
| |
| Introduction | |
| |
| |
| Graphs and Graph Models | |
| |
| |
| Connected Graphs | |
| |
| |
| Common Classes of Graphs | |
| |
| |
| Multigraphs and Digraphs | |
| |
| |
| Degrees | |
| |
| |
| The Degree of a Vertex | |
| |
| |
| Regular Graphs | |
| |
| |
| Degree Sequences | |
| |
| |
| Excursion: Graphs and Matrices | |
| |
| |
| Exploration: Irregular Graphs | |
| |
| |
| Isomorphic Graphs | |
| |
| |
| The Definition of Isomorphism | |
| |
| |
| Isomorphism as a Relation | |
| |
| |
| Excursion: Graphs and Groups | |
| |
| |
| Excursion: Reconstruction and Solvability | |
| |
| |
| Trees | |
| |
| |
| Bridges | |
| |
| |
| Trees | |
| |
| |
| The Minimum Spanning Tree Problem | |
| |
| |
| Excursion: The Number of Spanning Trees | |
| |
| |
| Connectivity | |
| |
| |
| Cut-Vertices | |
| |
| |
| Blocks | |
| |
| |
| Connectivity | |
| |
| |
| Menger's Theorem | |
| |
| |
| Exploration: Geodetic Sets | |
| |
| |
| Traversability | |
| |
| |
| Eulerian Graphs | |
| |
| |
| Hamiltonian Graphs | |
| |
| |
| Exploration: Hamiltonian Walks and Numbers | |
| |
| |
| Excursion: The Early Books of Graph Theory | |
| |
| |
| Digraphs | |
| |
| |
| Strong Digraphs | |
| |
| |
| Tournaments | |
| |
| |
| Excursion: Decision-Making | |
| |
| |
| Exploration: Wine Bottle Problems | |
| |
| |
| Matchings and Factorization | |
| |
| |
| Matchings | |
| |
| |
| Factorization | |
| |
| |
| Decompositions and Graceful Labelings | |
| |
| |
| Excursion: Instant Insanity | |
| |
| |
| Excursion: The Petersen Graph | |
| |
| |
| Exploration: -Labeling of Graphs | |
| |
| |
| Planarity | |
| |
| |
| Planar Graphs | |
| |
| |
| Embedding Graphs on Surfaces | |
| |
| |
| Excursion: Graph Minors | |
| |
| |
| Exploration: Embedding Graphs in Graphs | |
| |
| |
| Coloring | |
| |
| |
| The Four Color Problem | |
| |
| |
| Vertex Coloring | |
| |
| |
| Edge Coloring | |
| |
| |
| Excursion: The Heawood Map Coloring Theorem | |
| |
| |
| Exploration: Local Coloring | |
| |
| |
| Ramsey Numbers | |
| |
| |
| The Ramsey Number of Graphs | |
| |
| |
| Turan's Theorem | |
| |
| |
| Exploration: Rainbow Ramsey Numbers | |
| |
| |
| Excursion: Erd�s Numbers | |
| |
| |
| Distance | |
| |
| |
| The Center of a Graph | |
| |
| |
| Distant Vertices | |
| |
| |
| Excursion: Locating Numbers | |
| |
| |
| Excursion: Detour and Directed Distance | |
| |
| |
| Exploration: Channel Assignment | |
| |
| |
| Exploration: Distance Between Graphs | |
| |
| |
| Domination | |
| |
| |
| The Domination Number of a Graph | |
| |
| |
| Exploration: Stratification | |
| |
| |
| Exploration: Lights Out | |
| |
| |
| Excursion: And Still It Grows More Colorful | |
| |
| |
| Sets and Logic | |
| |
| |
| Equivalence Relations and Functions | |
| |
| |
| Methods of Proof | |