P383: Enumeration of all spanning trees of a graph

P383: Enumeration of all spanning trees of a graph

Input:

A graph $G$.

Output:

All spanning trees of $G$.

Complexity:

Comment:

Reference:

[Mayeda1965a] (Bibtex)