Assertion: graph | /r/CapableOf | end at initial vertex
Facets:
Source sentences:
text: Like the graph 1 above, if a graph has a path that includes every vertex exactly once, while ending at the initial vertex, the graph is Hamiltonian (is a Hamiltonian graph).