ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Mon, 29 Jul 2019 19:11:24 +0200Is there a built-in function to compute ALL the Hamiltonian cycles in a graph?https://ask.sagemath.org/question/47279/is-there-a-built-in-function-to-compute-all-the-hamiltonian-cycles-in-a-graph/ The function hamiltonian_cycle only computes one Hamiltonian cycle of a graph, how can we compute all the cycles if there are more than one.Sun, 28 Jul 2019 08:06:23 +0200https://ask.sagemath.org/question/47279/is-there-a-built-in-function-to-compute-all-the-hamiltonian-cycles-in-a-graph/Comment by dan_fulea for <p>The function hamiltonian_cycle only computes one Hamiltonian cycle of a graph, how can we compute all the cycles if there are more than one.</p>
https://ask.sagemath.org/question/47279/is-there-a-built-in-function-to-compute-all-the-hamiltonian-cycles-in-a-graph/?comment=47302#post-id-47302Which is exactly the question? The one in the title, which is strictly speaking a sage question, and the answer is no, looking at the methods of some specific instance of the example graph `G = graphs.CubeGraph(3)`. Or the one in the short post, where we have a soft question "How can we compute all (Hamiltonian) cycles?" - and please show us the own efforts, and/or give references for some algorithm, and/or declare an explicit graph of interest...Mon, 29 Jul 2019 19:11:24 +0200https://ask.sagemath.org/question/47279/is-there-a-built-in-function-to-compute-all-the-hamiltonian-cycles-in-a-graph/?comment=47302#post-id-47302