Content deleted Content added
Tangi-tamma (talk | contribs) mNo edit summary |
PLEASE STOP. You are not helping Wikipedia become better; you are only succeeding in annoying the editors who you should be enlisting to work with you. There is nothing wrong with these refs. |
||
Line 1:
{{orphan|date=March 2008}}
In [[graph theory]], a '''string graph''' is an [[intersection graph]] of [[Curve|curves]] in the plane; each curve is called a "string". 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''.
| |||