Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph theory concept
|
| gptkbp:appearsIn |
gptkb:Icosian_game
|
| gptkbp:application |
gptkb:Traveling_salesman_problem
gptkb:Bioinformatics Puzzle design |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
A path in a graph that visits each vertex exactly once
|
| gptkbp:existsIn |
Directed graphs
Undirected graphs |
| gptkbp:field |
gptkb:Mathematics
gptkb:Graph_theory |
| gptkbp:generalizes |
Path in a graph
|
| gptkbp:hasProperty |
Visits every vertex exactly once
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian Path
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:notNecessarilyCycle |
True
|
| gptkbp:NP-complete |
Decision problem of existence
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_path_problem
gptkb:Hamiltonian_Cycle gptkb:Eulerian_Path |
| gptkbp:studiedBy |
gptkb:William_Rowan_Hamilton
|
| gptkbp:bfsParent |
gptkb:Karp's_21_NP-complete_problems
gptkb:Non-Hamiltonian_Graph |
| gptkbp:bfsLayer |
6
|