Title of article
Construction of planar triangulations with minimum degree 5 Original Research Article
Author/Authors
G. Brinkmann، نويسنده , , Brendan D. McKay، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
17
From page
147
To page
163
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
Planar triangulation , Cubic graph , Fullerene , Generation
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948245
Link To Document