.. _sphx_glr_api_gallery_graph_theory_hamiltonian:

Hamiltonian cycles
------------------

Cycles that visit every vertex exactly once.


.. raw:: html

  <div id='sg-tag-list' class='sphx-glr-tag-list'></div>


.. raw:: html

    <div class="sphx-glr-thumbnails">

.. thumbnail-parent-div-open

.. raw:: html

    <div class="sphx-glr-thumbcontainer" tooltip="Solves Hamilton&#x27;s 1857 puzzle: travel along the edges of a dodecahedron through all 20 vertices exactly once and return to the start. The same search shows that the Petersen graph has no such cycle.">

.. only:: html

  .. image:: /api/gallery/graph_theory/hamiltonian/images/thumb/sphx_glr_plot_01_icosian_game_thumb.png
    :alt:

  :doc:`/api/gallery/graph_theory/hamiltonian/plot_01_icosian_game`

.. raw:: html

      <div class="sphx-glr-thumbnail-title">Hamilton's icosian game</div>
    </div>


.. thumbnail-parent-div-close

.. raw:: html

    </div>


.. toctree::
   :hidden:

   /api/gallery/graph_theory/hamiltonian/plot_01_icosian_game