Selected Topics in Graph Theory, Volumes 1-3Lowell W. Beineke, Robin J. Wilson |
Contents
Topological Graph Theory | 15 |
The Proof of the Heawood Conjecture 51 557 | 51 |
The AppelHaken Proof of the FourColor Theorem | 83 |
Copyright | |
14 other sections not shown
Other editions - View all
Common terms and phrases
2-cell embedding adjacent algorithm arcs automorphism Beineke bipartite graph Chapter chromatic index color Combinatorial Theory complete graph component configurations conjecture connected graph contains Corollary current graph cycles denote digraph directed circuit disjoint dual edges of G eigenvalues Erdős Eulerian graphs example exists finite following result formula G₁ genus given graph G graph of order Graph Theory Hamiltonian circuit Hamiltonian graphs Harary Heawood hypomorphic integer isomorphic König property Lemma Let G line graph lower bound Mathematics matrix maximum valency Menger property Menger's theorem minimum number modulo non-orientable number of edges number of vertices orientable partition path permutation Petersen graph planar graph problem proof proved q edges Ramsey numbers reconstruction regions Ringel Section set of vertices strongly regular graphs subset subtournaments surface Theorem 2.1 tournaments trees triangle triangular embedding two-graph valency valency-sequence vertex vertex-set vertices of G vertices of valency voltage graph