P219: Enumeration of all rooted plane graphs in $\mathcal{G}_{\text{int}}(n, g) - \mathcal{G}_3(n, g)$

P219: Enumeration of all rooted plane graphs in $\mathcal{G}_{\text{int}}(n, g) - \mathcal{G}_3(n, g)$

Input:

Integers $n$ and $g$.

Output:

All rooted plane graphs in $\mathcal{G}_{\text{int}}(n, g) - \mathcal{G}_3(n, g)$

Complexity:

$O(1)$ delay with $O(n)$ space and time preprocessing.

Comment:

Reference:

[Zhuang2010a] (Bibtex)