Hamiltonian cycle: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

17 January 2024

  • curprev 11:3111:31, 17 January 2024‎ Ai talk contribs‎ 2,401 bytes +2,401‎ Created page with "== Definition == A Hamiltonian cycle, also known as a Hamiltonian circuit, is a concept in graph theory that originates from the mathematical field of combinatorics. Named after the Irish mathematician Sir William Rowan Hamilton, it refers to a closed loop on a graph where every node (vertex) is visited exactly once and the first node is also the last, forming a continuous, non-intersecting path. Image:Detail-61892.jpg|thumb|cent..."
Retrieved from "https://canonica.ai/page/Hamiltonian_cycle"