Muutke küpsiste eelistusi

Fundamentals of Graph Theory [Kõva köide]

  • Formaat: Hardback, 336 pages, kõrgus x laius: 254x178 mm, kaal: 333 g
  • Sari: Pure and Applied Undergraduate Texts
  • Ilmumisaeg: 30-May-2020
  • Kirjastus: American Mathematical Society
  • ISBN-10: 1470453428
  • ISBN-13: 9781470453428
Teised raamatud teemal:
  • Formaat: Hardback, 336 pages, kõrgus x laius: 254x178 mm, kaal: 333 g
  • Sari: Pure and Applied Undergraduate Texts
  • Ilmumisaeg: 30-May-2020
  • Kirjastus: American Mathematical Society
  • ISBN-10: 1470453428
  • ISBN-13: 9781470453428
Teised raamatud teemal:
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.
Preface ix
Chapter 1 Basics of Graphs
1(34)
1.1 Graphs as Models
1(3)
1.2 Representations of Graphs
4(3)
1.3 Graph Parameters
7(2)
1.4 Common Graph Classes
9(3)
1.5 Graph Operations
12(3)
1.6 Distance
15(3)
1.7 Bipartite Graphs
18(2)
1.8 Generalizations of Graphs
20(3)
Exercises
23(12)
Chapter 2 Trees and Connectivity
35(28)
2.1 Trees
35(4)
2.2 Tree Algorithms
39(3)
2.3 Connectivity
42(4)
2.4 Menger's Theorem
46(7)
Exercises
53(10)
Chapter 3 Structure and Degrees
63(38)
3.1 Eulerian Graphs
63(4)
3.2 Graph Isomorphism
67(6)
3.3 Degree Sequences
73(5)
3.4 Degeneracy
78(9)
Exercises
87(14)
Chapter 4 Vertex Coloring
101(30)
4.1 Applications of Coloring
101(2)
4.2 Coloring Bounds
103(6)
4.3 Coloring and Operations
109(2)
4.4 Extremal fc-chromatic Graphs
111(4)
4.5 Perfect Graphs
115(4)
Exercises
119(12)
Chapter 5 Planarity
131(36)
5.1 The Four Color Theorem
131(3)
5.2 Planar Graphs
134(5)
5.3 Kuratowski's Theorem
139(6)
5.4 Dual Graphs and Geometry
145(9)
5.5 Genus of Graphs
154(4)
Exercises
158(9)
Chapter 6 Hamiltonian Graphs
167(30)
6.1 Finding Hamiltonian Cycles
168(6)
6.2 Hamiltonian Applications
174(5)
6.3 Hamiltonian Planar Graphs
179(2)
6.4 Tournaments
181(5)
Exercises
186(11)
Chapter 7 Matchings
197(30)
7.1 Bipartite Matchings
197(6)
7.2 Tutte's 1-Factor Theorem
203(3)
7.3 Edge Coloring
206(3)
7.4 Tait Coloring
209(3)
7.5 Domination
212(5)
Exercises
217(10)
Chapter 8 Generalized Graph Colorings
227(18)
8.1 List Coloring
227(3)
8.2 Vertex Arboricity
230(1)
8.3 Grundy Numbers
231(2)
8.4 Distance and Sets
233(5)
Exercises
238(7)
Chapter 9 Decompositions
245(32)
9.1 Decomposing Complete Graphs
246(7)
9.2 General Decompositions
253(3)
9.3 Ramsey Numbers
256(8)
9.4 Nordhaus-Gaddum Theorems
264(5)
Exercises
269(8)
Chapter 10 Appendices
277(32)
10.1 Proofs
277(13)
10.2 Counting Techniques and Identities
290(8)
10.3 Computational Complexity
298(4)
10.4 Bounds and Extremal Graphs
302(3)
10.5 Graph Characterizations
305(4)
Nomenclature 309(4)
Bibliography 313(16)
Index 329
Allan Bickle, Pennsylvania State University Altoona, PA