Trees in Polyhedral Graphs

1966/01/01 by David Barnette · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Interconnection Networks and Systems

paper · pdf · doi: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 .

Cited by

• Connectivity Oracles for Planar Graphs
• A zero-free interval for chromatic polynomials of graphs with 3-leaf\n spanning trees
• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem

Related

• A classification of polyhedral graph by combinatorially rigid vertices
• Polygonal Complexes and Graphs for Crystallographic Groups
• On polyhedral graphs and their complements
• Classification of polyhedral graphs by numbers of common neighbours
• Trees in simple Polygons