HAMILTONIAN PROBLEM

Domain	Definition
Computing	Hamiltonian problem (Or "Hamilton's problem") A problem in graph theory posed by William Hamilton: given a graph, is there a path through the graph which visits each vertex precisely once (a "Hamiltonian path")? Is there a Hamiltonian path which ends up where it started (a "Hamiltonian cycle" or "Hamiltonian tour")? Hamilton's problem is NP-complete. It has numerous applications, sometimes completely unexpected, in computing. Home (http://www.ing.unlp.edu.ar/cetad/mos/Hamilton.html). (1997-07-18). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Crosswords: HAMILTONIAN PROBLEM

Anagrams: HAMILTONIAN PROBLEM

Scrabble® YAWL-Verified Anagrams
	Words within the letters "a-a-b-e-h-i-i-l-l-m-m-n-n-o-o-p-r-t"
	-5 letters: morphinomania.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Alternative Orthography: HAMILTONIAN PROBLEM

Hexadecimal (or equivalents, 770AD-1900s) (references)

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

HTML Code (1990) (references)

ISO 10646 (1991-1993) (references)

Encryption (beginner's substitution cypher): (references)