Assertion: graph's component | /r/HasProperty | 2-edge-connected
Facets:
Source sentences:
text: Equivalent conditions are that each connected component of the graph has an open ear decomposition, that each connected component is 2-edge-connected, or (by Robbins' theorem) that every connected component has a strong orientation.