P474: Enumeration of all spanning trees in a graph

P474: Enumeration of all spanning trees in a graph

Input:

A graph $G$.

Output:

All spanning trees in $G$

Complexity:

Comment:

Reference:

[Maxwell1966] (Bibtex)