Hamiltonian Cycles through Polyhedral Skeletons

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

A Hamiltonian cycle is a cycle in a graph that visits every vertex exactly once. This Demonstration challenges you to find a Hamiltonian cycle through graphs of various polyhedral skeletons. If the "drag locators" checkbox is checked, each vertex has a locator that you can drag from one point to another in order to help you find a Hamiltonian cycle. (It is helpful to drag a vertex close to the next vertex but not covering the its locator). Check the box "show possible answer" to view one possible answer.

Contributed by: Sophia Chen (January 2020)
Open content licensed under CC BY-NC-SA


This was a project for Advanced Topics in Mathematics II, 2018–2019, Torrey Pines High School, San Diego, CA.


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.