P168: Enumeration of all based biconnected plane quadrangulations with at most $f$ faces
P168: Enumeration of all based biconnected plane quadrangulations with at most $f$ faces
Input:
An integer $f$.
Output:
All based biconnected plane quadrangulations with at most $f$ faces.
Complexity:
$O(1)$ time per quadrangulation and $O(f)$ space.
Comment:
A \textit{plane quadrangulation} is a plane graph such that each inner face has exactly four edges on its contour. A \textit{based plane quadrangulation} is a plane quadrangulation with one designated edge on the outer face.