Construction of planar triangulations with minimum degree 5
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.
|Collections||ANU Research Publications|
|01_Brinkmann_Construction_of_planar_2005.pdf||232.92 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.