Graph Theory (on Demand Printing Of 02787)An effort has been made to present the various topics in the theory of graphs in a logical order, to indicate the historical background, and to clarify the exposition by including figures to illustrate concepts and results. In addition, there are three appendices which provide diagrams of graphs, directed graphs, and trees. The emphasis throughout is on theorems rather than algorithms or applications, which however are occaisionally mentioned. |
Common terms and phrases
1-factor 2-connected adjacency matrix Amer automorphism Beineke bipartite block C₁ Canad Chartrand chromatic number chromatic polynomial cocycle Combinatorial Theory complete graphs connected graph Corollary counting series cubic graph cutpoint d₁ defined denoted digraph disconnected disjoint dual E. M. Palmer e₁ enumeration exactly Four Color Conjecture G contains G is connected G₁ G₂ given graph graph G graph theory graphical hamiltonian graph Harary homeomorphic incident induced subgraph integer isomorphic K₁ labeled graph Let G line graph line of G line-symmetric Math matroid maximum number Menger's Theorem n-connected nonadjacent points nontrivial number of lines number of points obtained P₁ pair partition path joining permutation group planar graph plane map points and lines points of degree points of G Pólya's problem proof proved result rooted trees S₁ shown in Fig spanning tree subgraph of G subsets tournament triangles Tutte u₁ uniquely n-colorable vertices W. T. Tutte w₁