Assertion: complete graph | /r/HasProperty | converted to oriented graph
Facets:
value: by removing every 2-cycle
type: MANNER
Source sentences:
text: A complete directed graph can be converted to an oriented graph by removing every 2-cycle, and conversely an oriented graph can be converted to a complete directed graph by adding a 2-cycle between every pair of vertices that are not endpoints of an edge; these correspondences are bijective.