Assertion: graph's cycle | /r/CapableOf | cover each edge of the graph
Facets:
value: exactly twice
type: TEMPORAL
Source sentences:
text: The cycle double cover conjecture states that, for every bridgeless graph, there exists a multiset of simple cycles that covers each edge of the graph exactly twice.