Assertion: graph's path | /r/CapableOf | visit each vertex of the graph
Facets:
value: exactly once
type: TEMPORAL
Source sentences:
text: A Hamiltonian path or traceable path is a path that visits each vertex of the graph exactly once.
text: A Hamiltonian path or traceable path is a path that visits each vertex of the graph exactly once.