Graph TheoryDesigned for the non-specialist, this classic text by a world expert is an invaluable reference tool for those interested in a basic understanding of the subject. Exercises, notes and exhaustive references follow each chapter, making it outstanding both as a text and reference for students and researchers in graph theory and its applications.The author approaches the subject with a lively writing style. The reader will delight to discover that the topics in this book are coherently unified and include some of the deepest and most beautiful developments in graph theory. |
Contents
IV | 1 |
V | 5 |
VI | 9 |
VII | 11 |
VIII | 14 |
IX | 18 |
X | 22 |
XI | 27 |
LXII | 170 |
LXIII | 174 |
LXIV | 178 |
LXV | 180 |
LXVI | 181 |
LXVII | 183 |
LXIX | 184 |
LXX | 185 |
XII | 30 |
XIII | 31 |
XV | 32 |
XVI | 37 |
XVII | 41 |
XVIII | 43 |
XIX | 46 |
XX | 50 |
XXI | 52 |
XXII | 53 |
XXIV | 54 |
XXV | 56 |
XXVI | 60 |
XXVII | 64 |
XXVIII | 66 |
XXIX | 68 |
XXXI | 69 |
XXXII | 70 |
XXXIII | 74 |
XXXIV | 83 |
XXXV | 95 |
XXXVI | 104 |
XXXVII | 111 |
XXXVIII | 113 |
XXXIX | 114 |
XLI | 115 |
XLII | 118 |
XLIII | 119 |
XLIV | 122 |
XLV | 123 |
XLVI | 124 |
XLVIII | 125 |
XLIX | 129 |
L | 133 |
LI | 138 |
LII | 142 |
LIII | 149 |
LIV | 152 |
LV | 158 |
LVI | 159 |
LVIII | 161 |
LIX | 163 |
LX | 167 |
LXI | 168 |
LXXI | 188 |
LXXII | 194 |
LXXIII | 197 |
LXXIV | 200 |
LXXV | 204 |
LXXVI | 206 |
LXXVII | 209 |
LXXVIII | 215 |
LXXIX | 217 |
LXXX | 218 |
LXXXI | 219 |
LXXXIII | 220 |
LXXXIV | 221 |
LXXXV | 226 |
LXXXVI | 233 |
LXXXVII | 237 |
LXXXVIII | 240 |
LXXXIX | 243 |
XC | 248 |
XCI | 250 |
XCII | 251 |
XCIV | 253 |
XCV | 257 |
XCVI | 259 |
XCVII | 261 |
XCVIII | 263 |
XCIX | 268 |
CI | 275 |
CII | 281 |
CIII | 283 |
CIV | 284 |
CVI | 285 |
CVII | 288 |
CVIII | 290 |
CIX | 296 |
CX | 306 |
CXI | 311 |
CXII | 314 |
CXIII | 317 |
CXIV | 320 |
CXV | 325 |
| 326 | |
| 327 | |
Common terms and phrases
0-chain 2-connected 2-separation A₁ adjoining arborescence B₁ belongs bicursal block of G bridge C₁ cell-base chain-group chromatic polynomials coefficient color common vertices component of G connected graph corresponding cross-cap crosses cubic graph cut-vertex D₁ dart deduce define definition deleting denote digraph distinct edge of G end-graphs ends Euler characteristic Eulerian Eulerian path f-barrier f-factor f-limited f₁ G is connected G₁ graph G graph theory H₁ Hamiltonian circuits Hence incident induced subgraph isomorphism isthmus K₁ L₁ L₂ Let G Let H link of G link-graph loop Menger's Theorem N₁ nonnull null graph orbits oriented P₁ p₁(G path path-bundle permutation Petersen graph planar graphs planar map planar mesh po(G premap Proof proper subgraph residual graphs respectively satisfies sequence spanning subgraph subgraph H subgraph of G subset Suppose unicursal v₁ valency vertex of G vertex-graph vertices of attachment W. T. Tutte write X₁ zero