Mathematical Puzzles

Dual Cryptograms

Anagrams Cryptograms Doublets
Logic Puzzles Magic Word Squares Sudoku
Chess Fractal Puzzles Tangrams




Intellectual Puzzles
List of Puzzles
Analytical Puzzles
Christmas Puzzles
New Year's Puzzles
Fractal Puzzles
Easter Puzzles
Nature Fractals
Encrypted Quotations
Fractal Images
Baseball Puzzles
Daily Fractal Puzzle
Math Recreations
Algebra Placement
Cryptogram Challenge
Tangram Stories
Puzzle Categories
Thanksgiving Quotes
Christmas Quotes
Christmas Logic
New Year Resolutions
Advertise With Us



Previous Topic

Next Topic


A Hamiltonian cycle, also known as Hamiltonian path, is path through a graph that starts and ends at the same vertex and includes or visits every other vertex exactly once. It also should not pass any edge more than once. Determining whether such paths and cycles exist in graphs is a problem of interest in the mathematical field of graph theory.

Hamiltonian cycles are named after William Rowan Hamilton (1805-1865) who invented a puzzle called the Icosian Game, also known as Hamilton's puzzle. This puzzle involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. This problem can be solved using the Icosian Calculus, an algebraic structure based on roots of unity.


More Mathematical Recreations

Previous Topic

Next Topic


Custom Search

MX iTunes, App Store, iBookstore, and Mac App Store


Hosted By Web Hosting by PowWeb

2000-2013 Logicville