Assertion: graph's g | /r/HasProperty | the intersection graph of s
Facets:
Source sentences:
text: If P is either a polygon or a set of points, S is the set of open line segments that have vertices of P as endpoints and are otherwise disjoint from P, and G is the intersection graph of S (a graph that has a vertex for each line segment in S and an edge for each two line segments that cross each other), then G is well-covered.