Construction of planar triangulations with minimum degree 5
-
Altmetric Citations
Brinkmann, Gunnar; McKay, Brendan
Description
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 |
---|---|
Date published: | 2005 |
Type: | Journal article |
URI: | http://hdl.handle.net/1885/83635 |
Source: | Discrete Mathematics |
DOI: | 10.1016/j.disc.2005.06.019 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
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.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator