Trees in Polyhedral Graphs
David W. Barnette · Canadian Journal of Mathematics · 1966
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.