Assertion: graph's vertex | /r/AtLocation | the boundary of the outer face
Facets:
value: multiple times
type: TEMPORAL
Source sentences:
text: For any plane graph G, let G+ be the plane multigraph formed by adding a single new vertex v in the unbounded face of G, and connecting v to each vertex of the outer face (multiple times, if a vertex appears multiple times on the boundary of the outer face); then, G is the weak dual of the (plane) dual of G+.