I wish to obtain the number of mutually disjoint hamiltonian cycles in a given graph. Is there any command in SageMath to do it. I think of iterating over getting the hamiltonian cycle of the graph using G.hamiltonian_cycle() function, by deleting the edges of the cycles obtained at each successive iteration from the graph. However, is there a built-in function in SageMath for this? Thanks beforehand.
Revision history [back]
 | 1 | initial version |
Number of disjoint hamiltonian cycles in a graph
Number of disjoint hamiltonian cycles in a graph
I wish to obtain the maximum number of mutually disjoint hamiltonian cycles in a given graph. Is there any command in SageMath to do it. I think of iterating over getting the hamiltonian cycle of the graph using G.hamiltonian_cycle() function, by deleting the edges of the cycles obtained at each successive iteration from the graph. However, is there a built-in function in SageMath for this? Thanks beforehand.
