P477: Enumeration of all 2cotrees in a graph

P477: Enumeration of all 2cotrees in a graph

Input:

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

Output:

All 2cotrees in $G$.

Complexity:

Comment:

A 2cotree is a subgraph with $|E|-|V|$ edges of $G$ which forms cotree of $G$.

Reference:

[Maxwell1966] (Bibtex)