Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
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.
|Collections||ANU Research Publications|
|Source:||Discussiones Mathematicae - Graph Theory|
|01_Hasheminezhad_Recursive_generation_of_simple_2010.pdf||208.94 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.