Proceedings of the 250th Anniversary Conference on Graph Theory Held at Indiana University-Purdue University at Fort Wayne, March 13-15, 1986, Volume 1K. S. Bagga Utilitas Mathematica Pub., 1988 - Graph theory |
Other editions - View all
Common terms and phrases
1-factor 2-valent vertices 4-regular graph A-trail adjacent algorithm Beineke blocks breadth-first search C₁ chord circuit decomposition circuit double cover complete bipartite graphs complete graph composition operations connected construct contains copies corresponding cutset cutvertex cutvertices cycle cyclic defined degree deleted denote depth-first search digraphs display embedding Erdös eulerian graph eulerian trail example exists factor families of graphs finite Frank Harary G₁ G₂ given graph G Graph Theory hamilton circuit harmonious coloring Hence hypomorphic hypomorphic mapping set incident infinite graphs integer isomorphic joined k-terminal recursive family k-trees labels Lemma Let G linear Mathematics matrices method multigraph number of edges number of vertices obtained orbits pairs perfect matching permutation planar graphs plane drawing PQ-tree problem procedure prove random graph reconstruction conjecture result series-parallel graphs shown in Figure signed graphs simple graph spanning tree structure system of transitions T₁ tournaments vertex