Results 1 -
1 of
1
Construction of planar triangulations with minimum degree 5
, 1969
"... In this article we describe a method of constructing all simple triangulations of the sphere with minimum degree 5; equivalently, 3-connected planar cubic graphs with girth 5. We also present the results of a computer program based on this algorithm, including counts of convex polytopes of minimum d ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In this article we describe a method of constructing all simple triangulations of the sphere with minimum degree 5; equivalently, 3-connected planar cubic graphs with girth 5. We also present the results of a computer program based on this algorithm, including counts of convex polytopes of minimum degree 5. Key words: planar triangulation, cubic graph, generation, fullerene
