Assertion: graph's edge | /r/HasProperty | added
Facets:
Source sentences:
text: is acyclic, and a simple cycle is formed if any edge is added to .
text: There are also efficient algorithms to dynamically track the components of a graph as vertices and edges are added, as a straightforward application of disjoint-set data structures.
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.