Skip navigation
Skip navigation

Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4

Hasheminezhad, Mahdieh; McKay, Brendan

Description

We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are known as octahedrites, can all be obtained from an elementary family of starting graphs by repeatedly applying two expansion operations. This allows for construction of a linear time generator of all graphs in the class with at most a given order, up to isomorphism.

CollectionsANU Research Publications
Date published: 2010
Type: Journal article
URI: http://hdl.handle.net/1885/64358
Source: Discussiones Mathematicae - Graph Theory

Download

File Description SizeFormat Image
01_Hasheminezhad_Recursive_generation_of_simple_2010.pdf208.94 kBAdobe PDF    Request a copy


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

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator