Construction of planar triangulations with minimum degree 5 (1969)
Cached
Download Links
- [cs.anu.edu.au]
- [cs.anu.edu.au]
- [cs.anu.edu.au]
- DBLP
Other Repositories/Bibliography
by
G. Brinkmann
,
Brendan D. Mckay
| Citations: | 1 - 0 self |
BibTeX
@MISC{Brinkmann69constructionof,
author = {G. Brinkmann and Brendan D. Mckay},
title = {Construction of planar triangulations with minimum degree 5},
year = {1969}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. Key words: planar triangulation, cubic graph, generation, fullerene
