Assertion: graph's g | /r/HasProperty | a string graph
Facets:
value: given a graph
type: OTHER
Source sentences:
text: Given a graph G, G is a string graph if and only if there exists a set of curves, or strings, drawn in the plane such that no three strings intersect at a single point and such that the graph having a vertex for each curve and an edge for each intersecting pair of curves is isomorphic to G.