P133: Enumeration of all basic perfect 2-matchings in a graph

P133: Enumeration of all basic perfect 2-matchings in a graph

Input:

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

Output:

All basic perfect 2-matchings in $G$.

Complexity:

Incremental polynomial delay.

Comment:

A \textit{basic 2-matching} of $G$ is a subset of edges that cover the vertices with vertex-disjoint edges and vertex-disjoint odd cycles.

Reference:

[Boros2006] (Bibtex)