Assertion: graph's set | /r/HasAspect | cut
Facets:
value: by cut-cycle duality
type: OTHER
Source sentences:
text: But, by cut-cycle duality, if a set S of edges in a planar graph G is acyclic (has no cycles), then the set of edges dual to S has no cuts, from which it follows that the complementary set of dual edges (the duals of the edges that are not in S) forms a connected subgraph.