Assertion: graph's dual | /r/HasAspect | no 1-
Facets:
Source sentences:
text: Therefore, a planar graph is simple if and only if its dual has no 1- or 2-edge cutsets; that is, if it is 3-edge-connected.