Assertion: disconnected graph | /r/HasAspect | cyclic orientations
Facets:
value: totally
type: DEGREE
Source sentences:
text: An orientation of an undirected graph G is totally cyclic if and only if it is a strong orientation of every connected component of G. Robbins' theorem states that a graph has a strong orientation if and only if it is 2-edge-connected; disconnected graphs may have totally cyclic orientations, but only if they have no bridges.