Revision as of 11:55, 10 December 2022 edit Dodo0303 (talk \| contribs) 2 edits 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. ← Previous edit		Revision as of 14:19, 22 December 2022 edit undo LaundryPizza03 (talk \| contribs) Extended confirmed users, Page movers, Pending changes reviewers, Rollbackers 72,389 edits added Category:NP-complete problems using HotCat Tag: Reverted Next edit →
Line 157: [[Category:Topological graph theory]] [[Category:Intersection classes of graphs]] [[Category:NP-complete problems]]

String graph: Difference between revisions