Revision as of 06:32, 26 October 2009 edit Miym (talk \| contribs) 4,240 edits m →Background: markup fix ← Previous edit		Revision as of 07:02, 26 October 2009 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,811 edits →Other results: simplify Next edit →
Line 17: ==Other results== {{harvtxt\|Ehrlich\|Even\|Tarjan\|1976}} showed computing the chromatic number of string graphs to be ~~'''~~NP~~'''~~-hard. {{harvtxt\|Kratochvil\|1991}} ~~looked~~found atthat string graphs ~~and found that they~~ form an induced minor closed class, but not a minor closed class of graphs. ==Notes==

String graph: Difference between revisions