| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512182 | Discrete Mathematics | 2005 | 17 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
G. Brinkmann, Brendan D. McKay,