Revision as of 19:56, 2 June 2010 edit Citation bot 1 (talk \| contribs) Bots 130,044 edits m Citations: [Pu158]Removed redundant parameters. You can use this bot yourself! Report bugs here. ← Previous edit		Revision as of 10:54, 15 September 2010 edit undo Rjwilmsi (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 933,673 edits m page range fixes, replaced: \| pages = 593--606 → \| pages = 593–606 (2) using AWB (7126) Next edit →
Line 1: In [[graph theory]], a '''string graph''' is an [[intersection graph]] of [[~~Curve\|curves~~curve]]s 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''. == Background == Line 100: \| first1 = János \| last1 = Pach \| author1-link = János Pach \| first2 = Geza \| last2 = Tóth \| volume = 28 \| pages = ~~593--606~~593–606 \| year = 2002 \| doi = 10.1007/s00454-002-2891-4}}. Line 108: \| journal = [[Symposium on Theory of Computing\|Proceedings of the 33<sup>rd</sup> Annual ACM Symposium on the Theory of Computing (STOC 2001)]] \| year = 2001 \| pages = ~~241--246~~241–246}}. *{{citation \| first1 = Marcus \| last1 = Schaefer \| first2 = Eric \| last2 = Sedgwick \| first3 = Daniel \| last3 = Štefankovič

String graph: Difference between revisions