Selected Topics in Graph Theory, Volumes 1-3Lowell W. Beineke, Robin J. Wilson |
Contents
Eulerian Graphs | 17 |
Perfect Graphs | 55 |
Automorphism Groups of Graphs | 89 |
Copyright | |
5 other sections not shown
Other editions - View all
Common terms and phrases
1-way infinite a₁ Academic Press adjacent algorithm arcs Aut(G automorphism group bipartite graph Bollobás chromatic number clique color Combinatorial Theory comparability graph complete graph complete subgraph conjecture connected graph Corollary countable defined denote digraph dimension Discrete Math distance-transitive Erdős Eulerian graph Eulerian trail ex(n example extremal graph extremal problems following result forbidden subgraph G₁ graph contains graph G Graph Theory Graphen Hackenbush Halin Hamiltonian hypergraph induced subgraph infinite graphs infinite path integer interval graph isomorphic k-coloring labeled lattice lemma Let G London Math Lovász matrix maximum number Nash-Williams number of edges number of vertices obtained odd circuit pairs partially ordered sets partition perfect graph permutation planar graphs plane polynomial poset Proc proof proved random graphs Section set of vertices Simonovits subgraph of G subset switching class symmetric Theorem 3.1 Thomassen tournaments transitive Turán's theorem v₁ valency vertex vertex-set vertex-transitive vertex-transitive graph