Graph Theory and Its ApplicationsCRC Press, 2005年9月22日 - 800 頁 Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and abundance |
內容
Chapter 1 INTRODUCTION TO GRAPH MODELS | 1 |
Chapter 2 STRUCTURE AND REPRESENTATION | 57 |
Chapter 3 TREES | 115 |
Chapter 4 SPANNING TREES | 163 |
Chapter 5 CONNECTIVITY | 217 |
Chapter 6 OPTIMAL GRAPH TRAVERSALS | 247 |
Chapter 7 PLANARITY AND KURATOWSKIS THEOREM | 285 |
Chapter 8 DRAWING GRAPHS AND MAPS | 337 |
Chapter 12 SPECIAL DIGRAPH MODELS | 493 |
Chapter 13 NETWORK FLOWS AND APPLICATIONS | 533 |
Chapter 14 GRAPHICAL ENUMERATION | 577 |
Chapter 15 ALGEBRAIC SPECIFICATION OF GRAPHS | 613 |
Chapter 16 NONPLANAR LAYOUTS | 651 |
APPENDIX | 681 |
BIBLIOGRAPHY | 695 |
SOLUTIONS AND HINTS | 709 |
Chapter 9 GRAPH COLORINGS | 371 |
Chapter 10 MEASUREMENT AND MAPPINGS | 417 |
Chapter 11 ANALYTIC GRAPH THEORY | 469 |
| 757 | |
其他版本 - 查看全部
常見字詞
2-connected acyclic adjacent algorithm appendage Application assigned automorphism bijection binary bipartite graph Cayley graph Chapter circulant graph colors complete bipartite graph complete graph components connected graph construction contains Corollary corresponding cut-vertex cycle cycle graph DEFINITION degree deleting denoted depth-first depth-first search digraph directed disjoint drawing edge-coloring edge-connectivity edge-cut edge-set endpoints eulerian Example EXERCISES for Section Figure flow graph G graph graph graph of Exercise Graph Theory hamiltonian imbedding induced integers intersection graph isomorphism iteration labeled Lemma length Let G linear Markov matching matrix maximum minimum n-vertex non-adjacent non-tree number of edges pair path permutation Petersen graph planar problem Proof Proposition Prove result rooted rotation self-loops sequence shown shows simple graph spanning specified subgraph subset subtree Suppose surface TERMINOLOGY Theorem topological tour tournament trail traversal tree Tree-Growing vertex vertex-coloring vertex-connectivity vertex-set vertices voltage voltage graph walk