P220: Enumeration of all internally triconnected planar graphs

P220: Enumeration of all internally triconnected planar graphs

Input:

Integers $n$ and $g$.

Output:

All internally triconnected planar graphs with exactly $n$ vertices such that $\kappa(G) = 2$ and the size of each inner face is at most $g$.

Complexity:

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

Comment:

Reference:

[Zhuang2010a] (Bibtex)