P216: Enumeration of all biconnected plane graphs

P216: Enumeration of all biconnected plane graphs

Input:

Integers $n$ and $g$.

Output:

All biconnected plane graphs with at most $n$ vertices such that each inner face is of length at most $g$.

Complexity:

$O(n^3)$ time per solution on average with $O(n)$ space.

Comment:

Reference:

[Zhuang2010c] (Bibtex)