Assertion: graph's cycle | /r/CapableOf | cover each edge
Facets:
value: together
type: MANNER
value: exactly once
type: TEMPORAL
value: exactly twice
type: TEMPORAL
Source sentences:
text: Cycle double cover, a decomposition into a collection of cycles covering each edge exactly twice
text: If a finite undirected graph has even degree at each of its vertices, regardless of whether it is connected, then it is possible to find a set of simple cycles that together cover each edge exactly once: this is Veblen's theorem.