Content deleted Content added
No, we do not need a citation in the lead for a concept that the entire sourced content of the article elaborates |
m There is no need to restrict the set of strings to a set where no three strings intersect at the same point. Actually, the proof that Kn is a string graph is by made using n strings that intersect in one single point. |
||
Line 1:
{{short description|Intersection graph for curves in the plane}}
In [[graph theory]], a '''string graph''' is an [[intersection graph]] of [[Plane curve|curves in the plane]]; each curve is called a "string". Given a [[Graph (discrete mathematics)|graph]] {{mvar|G}}, {{mvar|G}} is a string graph [[if and only if]] there exists a set of curves, or strings,
== Background ==
| |||