Assertion: graph's edge | /r/PartOf | the cycle
Facets:
value: not itself
type: OTHER
Source sentences:
text: A chordless cycle in a graph, also called a hole or an induced cycle, is a cycle such that no two vertices of the cycle are connected by an edge that does not itself belong to the cycle.