Assertion: graph's g | /r/HasAspect | minimum degree
Facets:
value: in a 2-edge-connected graph
type: LOCATION
Source sentences:
text: G is 2-vertex-connected if and only if G has minimum degree 2 and C 1 is the only cycle in C. A vertex v in a 2-edge-connected graph G is a cut vertex if and only if v is the first vertex of a cycle in C - C 1 .