Trees in Polyhedral Graphs
- 1 January 1966
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 18, 731-736
- https://doi.org/10.4153/cjm-1966-073-4
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Simple paths on polyhedraPacific Journal of Mathematics, 1963
- Longest Simple Paths in Polyhedral GraphsJournal of the London Mathematical Society, 1962
- Simple paths on convex polyhedraPacific Journal of Mathematics, 1961
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952
- CONNECTIVITY THEOREMS FOR GRAPHSThe Quarterly Journal of Mathematics, 1952