P431: Enumeration of all $k$-trees in a graph

P431: Enumeration of all $k$-trees in a graph

Input:

A graph $G = (V, E)$.

Output:

All $k$-trees in $G$.

Complexity:

Comment:

A $k$-tree is a forest with $k$ connected components.

Reference:

[Hakimi1964] (Bibtex)