Mathematica has the “FindHamiltonCycle” that can have “All” as an option, so finding all of them. There appear to be a few papers out there that discuss the problem, but I don’t see any software being available. One of the more intriguing recent developments I remember seeing is a heuristic that isn’t guaranteed to be correct, but has yet to find an example where it fails, which can be found at https://sites.flinders.edu.au/flinders-hamiltonian-cycle-project/hcp-approac... Steve On Jun 15, 2020, at 7:18 PM, James Propp <jamespropp@gmail.com<mailto:jamespropp@gmail.com>> wrote: Does anyone know of a good software for counting Hamiltonian paths in a graph from one specified vertex to another? Jim Propp _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com<mailto:math-fun@mailman.xmission.com> https://urldefense.proofpoint.com/v2/url?u=https-3A__mailman.xmission.com_cg...