P161: Enumeration of all rooted triconnected plane triangulations with exactly $n$ vertices and $r$ leaves

P161: Enumeration of all rooted triconnected plane triangulations with exactly $n$ vertices and $r$ leaves

Input:

An integer $n$.

Output:

All triconnected rooted plane triangulations with exactly $n$ vertices and $r$ leaves.

Complexity:

$O(r)$ time per tree and $O(n)$ space.

Comment:

A \textit{rooted} plane triangulation is a plane triangulation with one designated vertex on the outer face.

Reference:

[Nakano2001] (Bibtex)