0
$\begingroup$

It is fairly easy to enumerate the directed Hamilton cycles of a complete directed graph by fixing one of the vertices and enumerating the permutations of the others via one of the next-permutation algorithms.

Question:
is there also an efficient algorithmic solution for enumerating the vertex-disjoint directed 3-cycle covers of a complete directed graph?

In this context efficient algorithm shall refer to the complexity of generating the successor cover to a random given one and not to generating all directed 3-cycle covers.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.