You are not logged in.
login | register
Tool: Hamiltonian Cycles
Tool Thumbnail

Go to: (opens a new window)
Description: This set of problems consists of a handful of randomly selected graphs for which the user is to find a Hamiltonian circuit or trail (i.e., a walk in the graph that uses every vertex exactly once) if it exists. If it does not exist, the user signals this by going on to the next problem. After the problem set is completed, the applet reports how many times the user gave up too soon!
Technology Type: Flash 
Author: Barbara Kaskosz
Language: English 
Cost: Does not require payment for use

Average Rating:  [0] Login to rate this resource
My MathTools: Login to Subscribe / Save This
Reviews: be the first to review this resource
Discussions: start a discussion of this resource

Tool: Planar Graphs
Courses: Discrete Math Hamiltonian circuits