Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Construction of planar triangulations with minimum degree 5

Date

Authors

Brinkmann, Gunnar

McKay, Brendan

Publisher

Elsevier

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

Keywords: Algorithms; Computer programming; Fullerenes; Convex polytopes; Cubic graphs; Planar triangulation; Graph theory Cubic graph; Fullerene; Generation; Planar triangulation

URI

http://hdl.handle.net/1885/83635

Collections

Open Access Research

Source

Discrete Mathematics

Type

Journal article

DOI

10.1016/j.disc.2005.06.019

Restricted until

2037-12-31

Downloads

File

Description

01_Brinkmann_Construction_of_planar_2005.pdf (232.92 KB)