How to find all Hamiltonian cycles of >G:=CartesianProduct(CycleGraph(k),PathGraph(n));? The command >IsHamiltonian(G); finds only one such a cycle and this is enough in the most cases. There is a command HamiltonianCycles[G, All] in Mathematica 7 , but I don't find any single command to consruct the Cartesian product of graphs there ( k and n may be large numbers).
