Assertion: graph's cycle | /r/CapableOf | cover each vertex
Facets:
value: exactly once
type: TEMPORAL
Source sentences:
text: The problem of finding a single simple cycle that covers each vertex exactly once, rather than covering the edges, is much harder.