Assertion: graph's path | /r/CapableOf | use every edge of a graph
Facets:
value: exactly once
type: TEMPORAL
Source sentences:
text: An Eulerian path is a walk that uses every edge of a graph exactly once.