Assertion: undirected graph | /r/HasProperty | connected
Facets:
Source sentences:
text: In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is both connected and acyclic.
text: An undirected graph is connected if every pair of vertices is connected by a path.
text: Strongly oriented planar graphs (graphs whose underlying undirected graph is connected, and in which every edge belongs to a cycle) are dual to directed acyclic graphs in which no edge belongs to a cycle.
text: An undirected graph is considered a tree if it is connected, has