论文信息 - Trees in Polyhedral Graphs

Trees in Polyhedral Graphs

A graph is said to be d-polyhedral provided it is isomorphic with the graph formed by the vertices and edges of a d-dimensional bounded (convex) polyhedron (d-polyhedron). A k-tree is a connected acyclic graph in which each vertex is of valence ⩽k.

D. Barnette

[1] G. A. Dirac,et al. CONNECTIVITY THEOREMS FOR GRAPHS , 1952 .

[2] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[3] T. A. Brown. Simple paths on convex polyhedra , 1961 .

[4] T. Motzkin,et al. Longest Simple Paths in Polyhedral Graphs , 1962 .

[5] J. Moon,et al. Simple paths on polyhedra. , 1963 .

[6] David Gale,et al. Neighborly and cyclic polytopes , 1963 .