Recursive Generation of 5-Regular Planar Graphs
-
Altmetric Citations
Hasheminezhad, Mahdieh; McKay, Brendan; Reeves, Tristian
Description
We describe for the first time how the 5-regular simple planar graphs can all be obtained from an elementary family of starting graphs by repeatedly applying a few local expansion operations. The proof uses an innovative amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic embedded 5-regular planar graphs is obtained with time complexity O(n 2) per isomorphism class.
Collections | ANU Research Publications |
---|---|
Date published: | 2009 |
Type: | Book chapter |
URI: | http://hdl.handle.net/1885/52657 |
DOI: | 10.1007/978-3-642-00202-1_12 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Hasheminezhad_Recursive_Generation_of_2009.pdf | 267.06 kB | Adobe PDF | Request a copy | |
02_Hasheminezhad_Recursive_Generation_of_2009.pdf | 430.23 kB | Adobe PDF | Request a copy | |
03_Hasheminezhad_Recursive_Generation_of_2009.pdf | 54.66 kB | Adobe PDF | Request a copy | |
04_Hasheminezhad_Recursive_Generation_of_2009.pdf | 541.23 kB | Adobe 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