Assertion: oriented graph | /r/CapableOf | direct acyclic graphs
Facets:
Source sentences:
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.