Content deleted Content added
Tangi-tamma (talk | contribs) mNo edit summary |
There is nothing wrong with the references here. Editor seems to on a crusade against anything conflicting with the badly-written Intersection (Line) Graphs of hypergraphs |
||
Line 1:
{{orphan|date=March 2008}}
In [[graph theory]], a '''string graph''' is an [[intersection graph]] of [[Curve| strings]] in a plane. Given a graph <math>G</math>, <math>G</math> is a string graph if and only if there exists a set of curves, or strings, that permit a drawing in the plane where no three strings intersect at the same point and the set of strings that intersect is isomorphic to <math>E(G)</math>. That is, a string graph is an intersection graph of curves in the plane where each curve is a vertex and each intersection an edge.
| |||