Skip navigation
Skip navigation

Construction of planar triangulations with minimum degree 5

Brinkmann, Gunnar; McKay, Brendan


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.

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
Source: Discrete Mathematics
DOI: 10.1016/j.disc.2005.06.019


File Description SizeFormat Image
01_Brinkmann_Construction_of_planar_2005.pdf232.92 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator