P417: Enumeration of all Hamiltonian circuits in a graph

P417: Enumeration of all Hamiltonian circuits in a graph

Input:

A graph $G$.

Output:

All Hamiltonian circuits in $G$.

Complexity:

Comment:

Reference:

[Yau1967] (Bibtex)