Assertion: graph's cycle | /r/MadeOf | each edge
Facets:
value: exactly twice
type: TEMPORAL
Source sentences:
text: An important open problem involving bridges is the cycle double cover conjecture, due to Seymour and Szekeres (1978 and 1979, independently), which states that every bridgeless graph admits a set of simple cycles which contains each edge exactly twice.