Assertion: graph's path | /r/HasProperty | hamiltonian
Facets:
Source sentences:
text: A graph that contains a Hamiltonian path is called a traceable graph.
text: A graph is Hamiltonian-connected if for every pair of vertices there is a Hamiltonian path between the two vertices.
text: A simple graph with n vertices has a Hamiltonian path if, for every non-adjacent vertex pairs the sum of their degrees and their shortest path length is greater than n.