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 |
Contents
R P JONES A Computer Representation for Graph Theory Knowledge 64131 | 63 |
PALMER Eulerian Subgraphs of Random Graphs 63139 | 139 |
PRITIKIN On Packing Odd and Even Trees 64187 | 187 |
Copyright | |
2 other sections not shown
Other editions - View all
Common terms and phrases
1-factor 4-regular A-trail adjacent basis graph blocks breadth-first search C₁ chord circuit decomposition combinatorial complete bipartite graphs complete graphs composition operations construct contains copies corresponding cutset cutvertex cutvertices cyclic defined deleted depth-first search digraphs Discrete Math edge reconstructible embedding Erdös eulerian graph eulerian trail example factor families of graphs family of partial finite Frank Harary G₁ G₂ given graph G Graph Theory graphs are reconstructible harmonious coloring Hence hypomorphic hypomorphic mapping set infinite graphs integer isomorphic joined k-terminal recursive family k-trees labels Lemma Let G Mathematics matrices method multigraph n-extendable graphs noncyclic number of edges number of vertices obtained orbits pairs perfect matching permutation planar graphs planarity testing plane drawing points PQ-tree procedure proof prove Q-vertex random graph reconstruction conjecture result root series-parallel graphs signed graphs simple graphs spanning tree Stockmeyer structure T₁ Theorem tournaments University vertex