Indexed metadata
Trees in Polyhedral Graphs
David Barnette
Source record
Source: Crossref
Published: Jan 1, 1966
DOI: 10.4153/cjm-1966-073-4
Open original source ↗Source 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 .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.