Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
Loading...
Date
Authors
Hasheminezhad, Mahdieh
McKay, Brendan
Journal Title
Journal ISSN
Volume Title
Publisher
Technical University Press Zielona Gora
Abstract
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.
Description
Citation
Collections
Source
Discussiones Mathematicae - Graph Theory
Type
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31