Assertion: graph's embedding | /r/HasProperty | particular
Facets:
Source sentences:
text: Because the dual graph depends on a particular embedding, the dual graph of a planar graph is not unique, in the sense that the same planar graph can have non-isomorphic dual graphs.