Hamiltonian path
path in a graph that visits each vertex exactly once
Facts
3 properties- Named after
- William Rowan Hamilton[1]
- Studied by
- graph theory[3]
🏷️ Also known as
en Hamiltonian path
en Hamilton path
en traceable path
ar مسار هاملتوني
cs Hamiltonovská cesta
de Hamilton-Weg
de Hamiltonweg
de Hamiltonabschluss
de Hamiltonpfad
de Hamiltonpfadproblem
de Hamiltonpfad-Problem
es camino hamiltoniano
fa گراف های همیلتونی
fa گرافهای همیلتونی
fa گراف همیلتونی
fa مسیر همیلتونی
fa مسیر و گراف همیلتنی
fi Hamiltonin kierros
fi Hamiltonin piiri
fi Hamiltonin polku
🔖 Identifiers · 12
- OpenAlex ID
- C86524685
- Image (Wikimedia Commons)
- Hamilton path.gif ↗
- Australian Educational Vocabulary ID
- scot/15481
- Dictionary of Algorithms and Data Structures ID
- hamiltonianPath
- Encyclopædia Britannica Online ID
- topic/Hamilton-circuit
- Freebase ID
- /m/01kdt6
- Graphclasses.org ID
- problem_Hamiltonian_path
- MathWorld ID
- HamiltonianPath
- Microsoft Academic ID (discontinued)
- 86524685
- PlanetMath ID
- HamiltonianPath
- Quora topic ID
- Hamiltonian-Path
- Topic's main category
- Category:Hamiltonian paths and cycles
🔗 Connections
Created notable works 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Subclass of 1
Subtypes 1
Topic's main category 1
← Category's main topic 1
← Facet of 1
← FactGrid item ID 1
Press Enter · cited answer in seconds