Assertion: dual graph | /r/HasProperty | 3-vertex-connected
Facets:
Source sentences:
text: A planar graph is 3-vertex-connected if and only if its dual graph is 3-vertex-connected.
text: A planar graph with four or more vertices is maximal (no more edges can be added while preserving planarity) if and only if its dual graph is both 3-vertex-connected and 3-regular.