In computational linguistics, "projective" sentences refer to dependency parses that have this property.  Scheinerman's theorem states that every graph with this property is the intersection graph of line segments.  Fáry's theorem says that graphs with this property can also be drawn with straight line segments.  Kuratowski's theorem states that a graph has this poperty if and only if it does not contain a minor or subgraph isomorphic to K3,3 or K5.  For ten points, name this property of graph theory describing graphs that can be drawn without overlapping lines. 
In computational linguistics, "projective" sentences refer to dependency parses that have this property.  Scheinerman's theorem states that every graph with this property is the intersection graph of line segments.  Fáry's theorem says that graphs with this property can also be drawn with straight line segments.  Kuratowski's theorem states that a graph has this poperty if and only if it does not contain a minor or subgraph isomorphic to K3,3 or K5.  For ten points, name this property of graph theory describing graphs that can be drawn without overlapping lines. 
In computational linguistics, "projective" sentences refer to dependency parses that have this property.  