Preface.
1.Fundamental Concepts.
1.1.What is a Graph?
1.2.Paths, Cycles, and Trails.
1.3.Vertex Degrees and Counting.
1.4.Directed Graphs.
2.Trees and Distance.
2.1.Basic Properties.
2.2.Spanning Trees and Enumeration.
2.3.Optimization and Trees.
3.Matchings and Factors.
3.1.Matchings and Covers.
3.2.Algorithms and Applications.
3.3.Matchings in General Graphs.
4.Connectivity and Paths.
4.1.Cuts and Connectivity.
4.2.k-Connected Graphs.
4.3.Network Flow Problems.
5.Coloring of Graphs.
5.1.Vertex Colorings and Upper Bounds.
5.2.Structure of k-Chromatic Graphs.
5.3.Enumerative Aspects.
6.Planar Graphs.
6.1.Embeddings and Euler's Formula.
6.2.Characterization of Planar Graphs.
6.3.Parameters of Planarity.
7.Edges and Cycles.
7.1.Line Graphs and Edge-Coloring.
7.2.Hamiltonian Cycles.
7.3.Planarity, Coloring, and Cycles.
8.Additional Topies(optional)
8.1.Perfect Graphs.
8.2.Matroids.
8.3.Ramsey Theory.
8.4.More Extremal Problems.
8.5.Random Graphs.
8.6.Eigenvalues of Graphs.
Appendix A.Mathematical Background.
Appendix B.Optimization and Complexity.
Appendix C.Hints for Selected Exercises.
Appendix D.Glossary of Terms.
Appendix E.Supplemental Reading.
Appendix F.References.
Author Index.
Subject Index.
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 ttbooks.qciss.net All Rights Reserved. 小特书站 版权所有