[Date Index] [Thread Index] [Author Index]

Re: Possible bug in HamiltonianCycle

• To: mathgroup at smc.vnet.net
• Subject: [mg83682] Re: Possible bug in HamiltonianCycle
• From: mumat <csarami at gmail.com>
• Date: Wed, 28 Nov 2007 05:33:00 -0500 (EST)
• References: <200711240910.EAA17540@smc.vnet.net> <figu6k$fgb$1@smc.vnet.net>

It is known that the HamiltonianCycle only works for Undirected Graphs
( not Digraphs).


A Hamiltonian circuit of a graph can be identified using
HamiltonianCycle[g] in the Mathematica package Combinatorica` (which
can be loaded with the command <<Combinatorica`) , which however only
gives correct results for undirected graphs.

Source: http://mathworld.wolfram.com/HamiltonianCircuit.html

• References:
  • Possible bug in HamiltonianCycle
    • From: "Steve Luttrell" <steve@_removemefirst_luttrell.org.uk>