Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph Theory Concept
|
| gptkbp:alsoKnownAs |
gptkb:Hamiltonian_Cycle
|
| gptkbp:application |
gptkb:Traveling_Salesman_Problem
|
| gptkbp:definedIn |
A cycle in a graph that visits each vertex exactly once and returns to the starting vertex
|
| gptkbp:example |
gptkb:Dodecahedron_Graph
gptkb:Icosahedron_Graph |
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian Circuit
|
| gptkbp:namedAfter |
gptkb:William_Rowan_Hamilton
|
| gptkbp:NP-complete |
gptkb:Decision_Problem
|
| gptkbp:property |
Exists only in certain graphs
Not every graph has a Hamiltonian circuit Every complete graph with more than two vertices has a Hamiltonian circuit |
| gptkbp:relatedTo |
gptkb:Hamiltonian_Path
Eulerian Circuit |
| gptkbp:studiedBy |
19th Century
|
| gptkbp:studiedIn |
gptkb:Graph_Theory
Combinatorics |
| gptkbp:usedIn |
Scheduling
Network Design Circuit Design |
| gptkbp:bfsParent |
gptkb:Hamiltonian_Cycle
|
| gptkbp:bfsLayer |
7
|