Assertion: graph's path | /r/CapableOf | traverse each edge
Facets:
value: exactly once such
type: TEMPORAL
Source sentences:
text: When there exists a path that traverses each edge exactly once such that the path begins and ends at the same vertex, the path is known as an Eulerian circuit, and the graph is known as an Eulerian graph.