P215: Enumeration of all biconnected rooted plane graphs

P215: Enumeration of all biconnected rooted plane graphs

Input:

Integers $n$ and $g$.

Output:

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

Complexity:

$O(1)$ delay with $O(n)$ space, after an $O(n)$ time preprocessing.

Comment:

Reference:

[Zhuang2010c] (Bibtex)