P475: Enumeration of all 2trees in a graph

P475: Enumeration of all 2trees in a graph

Input:

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

Output:

All 2trees in $G$.

Complexity:

Comment:

2tree: a subgraph with $|V|-2$ vertices of $G$ such that it consists of two connected components and has no circuits.

Reference:

[Maxwell1966] (Bibtex)