Assertion: graph | /r/HasProperty | hamiltonian-connected
Facets:
value: for every pair of vertices
type: OTHER
Source sentences:
text: A graph is Hamiltonian-connected if for every pair of vertices there is a Hamiltonian path between the two vertices.