超级安全：食品级实验用品，厨房内即可操作，达到实验零风险。
　　类型丰富：化学实验、物理实验、光学实验等，本书52个实验，一周一个，有趣的小实验，都与我们的生活息息相关，让孩子发现身边的科学。
　　简便易做：实验步骤简单易懂，实验用品都是我们日常生活中常见的东西，随手拈来即可操作，科学离我们那么近！  

Chapter 1 Graphs and Subgraphs
1.1 Graphs and Their Representation
1.2 Constructing Graphs from Other Graphs
1.3 Directed Graphs
1.4 Infinite Graphs
1.5 Subgraphs and Supergraphs
1.6 Spanning and Induced Subgraphs
1.7 Modifying Graphs
1.8 Edge Cuts and Bonds
1.9 Even Subgraphs
1.10 最短路算法
1.11 Exercises

Chapter 2 Trees
2.1 Forests and Trees
2.2 Cut Edges
2.3 Spanning Trees
2.4 Cut Vertices
2.5 Tree-Search Alogrithms
2.6 Minimum-Weight Spanning Trees Alogrithm
2.7 最小权支撑树问题及应用
2.8 Exercises

Chapter 3 Connected Graphs
3.1 Walks and Connection
3.2 Separations and Blocks
3.3 Vertex Connectivity
3.4 The Fan Lemma
3.5 Edge Connectivity
3.6 Three-Connected Graphs
3.7 Connection in Digraphs
3.8 Construction of Reliable Communication Networks
3.9 算法及应用
3.10 Exercises

Chapter 4 Euler Tours and Hamilton Cycle
4.1 Euler Tours
4.2 Hamiltonian and Nonhamiltonian Graphs
4.3 Path and Cycle Exchanges
4.4 Related Reading
4.5 算法及应用
4.6 Exercises

Chapter 5 Matchings
5.1 Maximum Matehings
5.2 Matchings in Bipartite Graphs
5.3 Matchings in Arbitrary Graphs
5.4 Perfect Matchings and Factors
5.5 Matching Algorithms
5.6 匹配算法理论及应用
5.7 Exercises

Chapter 6 Stable Sets and Cliques
6.1 Stable Sets
6.2 Turans Theorem
6.3 Ramseys Theorem
6.4 Random Graphs
6.5 支配集、点独立集、点覆盖集的求法
6.6 Exercises

Chapter 7 Colorings
7.1 Chromatic Number
7.2 Critical Graphs
7.3 Girth and Chromatic Number
7.4 Perfect Graphs
7.5 List Colorings
7.6 Edge Chromatic Number
7.7 Vizings Theorem
7.8 List Edge Colorings
7.9 Related Reading
7.10 图的点染色算法
7.11 Exercises

Chapter 8 Planar Graphs
8.1 Plane and Planar Graphs
8.2 Duality
8.3 Eulers Formula
8.4 Bridges
8.5 Kuratowskis Theorem
8.6 Colorings of Planar Maps
8.7 The Five-Color Theorem
8.8 Surface Embeddings of Graphs
8.9 Applications
8.10 Related Reading
8.11 不可平面图的几个研究方向简介
8.12 Exercises

Chapter 9 Flows in Networks
9.1 Transportation Network
9.2 The Max-Flow Min-Cut Theorem
9.3 Arc-Disjoint Directed Paths
9.4 网络最大流 Edmonds-Karp 算法
9.5 Exercises
参考文献

　　莉娜·斯卡尔佩利尼，蒙特利大学营养学学士及硕士，花样滑冰教练，瑜伽和普拉提教师，对教育、健康和舒适生活充满了热情。