Skip navigation
Skip navigation

Fast generation of planar graphs

Brinkmann, Gunnar; McKay, Brendan


The program plantri is the fastest isomorph-free generator of many classes of planar graphs, including triangulations, quadrangulations, and convex polytopes. Many applications in the natural sciences as well as in mathematics have appeared. This paper describes plantri's principles of operation, the basis for its efficiency, and the recursive algorithms behind many of its capabilities. In addition, we give many counts of isomorphism classes of planar graphs compiled using plantri. These...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
Source: MATCH - Communications in Mathematical and in Computer Chemistry


File Description SizeFormat Image
01_Brinkmann_Fast_generation_of_planar_2007.pdf292.92 kBAdobe PDF    Request a copy
02_Brinkmann_Fast_generation_of_planar_2007.pdf3.14 MBAdobe PDF    Request a copy

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

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator