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.
Original language | English |
---|---|
Pages (from-to) | 123-136 |
Number of pages | 14 |
Journal | Discussiones Mathematicae - Graph Theory |
Volume | 30 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2010 |