Assertion: graph's cycle | /r/CapableOf | visit each vertex
Facets:
value: exactly once
type: TEMPORAL
Source sentences:
text: Every hypercube Q n with n > 1 has a Hamiltonian cycle, a cycle that visits each vertex exactly once.
text: A Hamiltonian cycle, Hamiltonian circuit, vertex tour or graph cycle is a cycle that visits each vertex exactly once.