Assertion: graph | /r/HasProperty | dual
Facets:
value: without knowing their embeddings
type: MANNER
Source sentences:
text: Whenever two polyhedra are dual, their graphs are also dual.
text: Because different embeddings may lead to different dual graphs, testing whether one graph is a dual of another (without already knowing their embeddings) is a nontrivial algorithmic problem.