Assertion: graph's embedding | /r/HasProperty | unique
Facets:
Source sentences:
text: More generally, a planar graph has a unique embedding, and therefore also a unique dual, if and only if it is a subdivision of a 3-vertex-connected planar graph (a graph formed from a 3-vertex-connected planar graph by replacing some of its edges by paths).