Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| gptkbp:category |
graph connectivity
Hamiltonian properties |
| gptkbp:definedIn |
a graph in which for every pair of vertices there exists a Hamiltonian path between them
|
| gptkbp:example |
gptkb:graph
cycle graph with more than 2 vertices |
| gptkbp:field |
gptkb:mathematics
graph theory |
| gptkbp:implies |
the graph is connected
the graph is traceable |
| gptkbp:introduced |
graph theorists
|
| gptkbp:property_of |
undirected graphs
|
| gptkbp:relatedTo |
gptkb:Hamiltonian_cycle
gptkb:Hamiltonian_path gptkb:Hamiltonian_graph |
| gptkbp:stronger_than |
gptkb:Hamiltonian_graph
traceable graph |
| https://www.w3.org/2000/01/rdf-schema#label |
Hamiltonian-connected graph
|