P466: Enumerate $h$ hamiltonian cycles in a graph.

P466: Enumerate $h$ hamiltonian cycles in a graph.

Input:

A graph $G$ and an integer $h$.

Output:

$h$ hamiltonian cycles in $G$.

Complexity:

Comment:

Reference:

[Martello1983] (Bibtex)