<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - answers and comments on Question, How to find all Hamiltonian cycles?</title>
    <link>http://www.mapleprimes.com/questions/88581-How-To-Find-All-Hamiltonian-Cycles</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Thu, 11 Jun 2026 00:31:59 GMT</lastBuildDate>
    <pubDate>Thu, 11 Jun 2026 00:31:59 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest answers and comments added to the Question, How to find all Hamiltonian cycles?</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - answers and comments on Question, How to find all Hamiltonian cycles?</title>
      <link>http://www.mapleprimes.com/questions/88581-How-To-Find-All-Hamiltonian-Cycles</link>
    </image>
    <item>
      <title>GraphProduct</title>
      <link>http://www.mapleprimes.com/questions/88581-How-To-Find-All-Hamiltonian-Cycles?ref=Feed:MaplePrimes:How to find all Hamiltonian cycles?:Comments#answer88663</link>
      <itunes:summary>&lt;p&gt;In Mathematica, the Cartesian product of graphs is done by GraphProduct command.&lt;/p&gt;
&lt;p&gt;Alec&lt;/p&gt;</itunes:summary>
      <description>&lt;p&gt;In Mathematica, the Cartesian product of graphs is done by GraphProduct command.&lt;/p&gt;
&lt;p&gt;Alec&lt;/p&gt;</description>
      <guid>88663</guid>
      <pubDate>Fri, 28 May 2010 22:37:01 Z</pubDate>
      <itunes:author>Alec Mihailovs</itunes:author>
      <author>Alec Mihailovs</author>
    </item>
    <item>
      <title>Application</title>
      <link>http://www.mapleprimes.com/questions/88581-How-To-Find-All-Hamiltonian-Cycles?ref=Feed:MaplePrimes:How to find all Hamiltonian cycles?:Comments#answer124906</link>
      <itunes:summary>&lt;p&gt;Click&amp;nbsp; &lt;a href="http://mathoverflow.net/questions/72124/hamiltonian-cycles-and-fundamental-groups"&gt;http://mathoverflow.net/questions/72124/hamiltonian-cycles-and-fundamental-groups&lt;/a&gt;&amp;nbsp; for an application of all Hamiltonian cycles.&lt;/p&gt;</itunes:summary>
      <description>&lt;p&gt;Click&amp;nbsp; &lt;a href="http://mathoverflow.net/questions/72124/hamiltonian-cycles-and-fundamental-groups"&gt;http://mathoverflow.net/questions/72124/hamiltonian-cycles-and-fundamental-groups&lt;/a&gt;&amp;nbsp; for an application of all Hamiltonian cycles.&lt;/p&gt;</description>
      <guid>124906</guid>
      <pubDate>Fri, 19 Aug 2011 18:09:45 Z</pubDate>
      <itunes:author>Markiyan Hirnyk</itunes:author>
      <author>Markiyan Hirnyk</author>
    </item>
    <item>
      <title>Many thanks</title>
      <link>http://www.mapleprimes.com/questions/88581-How-To-Find-All-Hamiltonian-Cycles?ref=Feed:MaplePrimes:How to find all Hamiltonian cycles?:Comments#comment88664</link>
      <itunes:summary>&lt;p&gt;Many thanks. However, the question (How to do that in Maple?) is still open.&lt;/p&gt;</itunes:summary>
      <description>&lt;p&gt;Many thanks. However, the question (How to do that in Maple?) is still open.&lt;/p&gt;</description>
      <guid>88664</guid>
      <pubDate>Fri, 28 May 2010 23:40:30 Z</pubDate>
      <itunes:author>hirnyk</itunes:author>
      <author>hirnyk</author>
    </item>
    <item>
      <title>In Maple</title>
      <link>http://www.mapleprimes.com/questions/88581-How-To-Find-All-Hamiltonian-Cycles?ref=Feed:MaplePrimes:How to find all Hamiltonian cycles?:Comments#comment88665</link>
      <itunes:summary>&lt;p&gt;There are several algorithms known. All of them are exponential - with Maple's speed it would take forever for more than 10 or 12 vertices.&amp;nbsp;&lt;/p&gt;
&lt;p&gt;A reasonable option would be to find a library (a dll) where it is implemented and call the corresponding function in it from Maple using external calling.&lt;/p&gt;
&lt;p&gt;Or use one of existing executables - for example, &lt;a href="http://www.combinatorialmath.ca/G&amp;amp;G/Download.html"&gt;Ham Cycle unix tool&lt;/a&gt; (do &lt;code&gt;make clean&lt;/code&gt; first, then replace -fast with -O3 in the Makefile before doing &lt;code&gt;make release&lt;/code&gt;), prepare its input in Maple, and then call it from Maple usyng &lt;code&gt;ssystem&lt;/code&gt; command.&lt;/p&gt;
&lt;p&gt;I posted that procedure in &lt;a href="http://www.mapleprimes.com/blog/alec/hamiltoniancycles"&gt;my blog&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;But since you have Mathematica - why bother? You can just use it.&lt;/p&gt;
&lt;p&gt;Alec&lt;/p&gt;</itunes:summary>
      <description>&lt;p&gt;There are several algorithms known. All of them are exponential - with Maple's speed it would take forever for more than 10 or 12 vertices.&amp;nbsp;&lt;/p&gt;
&lt;p&gt;A reasonable option would be to find a library (a dll) where it is implemented and call the corresponding function in it from Maple using external calling.&lt;/p&gt;
&lt;p&gt;Or use one of existing executables - for example, &lt;a href="http://www.combinatorialmath.ca/G&amp;amp;G/Download.html"&gt;Ham Cycle unix tool&lt;/a&gt; (do &lt;code&gt;make clean&lt;/code&gt; first, then replace -fast with -O3 in the Makefile before doing &lt;code&gt;make release&lt;/code&gt;), prepare its input in Maple, and then call it from Maple usyng &lt;code&gt;ssystem&lt;/code&gt; command.&lt;/p&gt;
&lt;p&gt;I posted that procedure in &lt;a href="http://www.mapleprimes.com/blog/alec/hamiltoniancycles"&gt;my blog&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;But since you have Mathematica - why bother? You can just use it.&lt;/p&gt;
&lt;p&gt;Alec&lt;/p&gt;</description>
      <guid>88665</guid>
      <pubDate>Sat, 29 May 2010 07:55:57 Z</pubDate>
      <itunes:author>Alec Mihailovs</itunes:author>
      <author>Alec Mihailovs</author>
    </item>
  </channel>
</rss>