P476: Enumeration of all cotrees in a graph

P476: Enumeration of all cotrees in a graph

Input:

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

Output:

All cotrees in $G$.

Complexity:

Comment:

Cotree: a subgraph $S$ of $G$ such that $S = G - T$ for some spanning tree $T$, where $G - T$ is a subgraph of $G$ that does not contain edges in $T$.

Reference:

[Maxwell1966] (Bibtex)