Trees in Polyhedral Graphs

Barnette, David

Canadian journal of mathematics, Tome 18 (1966) no. 1, pp. 731-736

Résumé

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étail

DOI : 10.4153/CJM-1966-073-4

Bibliographie

[1] 1. Brown, T. A., Simple paths on convex polyhedra, Pacific J. Math., 11 (1961), 1211–1214. Google Scholar

[2] 2. Brown, T. A., Hamiltonian paths on convex polyhedra (unpublished note P-2069, The Rand Corporation, Santa Monica, Calif., 1960). Google Scholar

[3] 3. Dirac, G. A., Some theorems on abstract graphs, Proc. London Math. Soc, (3), 2 (1952), 69–81. Google Scholar

[4] 4. Dirac, G. A., Connectivity theorems for graphs, Quart. J. Math. Oxford Ser. (2), 3 (1952), 171–174. Google Scholar

[5] 5. Gale, D., Neighborly and cyclic polytopes, Proc. Symp. Pure Math., 7, Convexity (Providence, R.I., 1963), 225–232. Google Scholar

[6] 6. Grünbaum, B., Steinitz's characterization of convex polyhedra in E3 (hectographed notes, University of Washington, 1963). Google Scholar

[7] 7. Grünbaum, B. and Motzkin, T. S., Longest simple paths in polyhedral graphs, J. London Math. Soc, 37 (1962), 152–160. Google Scholar

[8] 8. Grünbaum, B. and Motzkin, T. S., On polyhedral graphs, Proc. Symp. Pure Math., 7, Convexity (Providence, R.I., 1963), 285–290. Google Scholar

[9] 9. Moon, J. W. and Moser, L., Simple paths on polyhedra, Pacific J. Math., 13 (1963), 629–631. Google Scholar

[10] 10. Steinitz, E. and Rademacher, H., Vorlesungen über die Theorie der Polyeder, (Berlin, 1934). Google Scholar