[EET] Ehrlich G., Even S., Tarjan R. E.: Intersection graphs of curves in the plane. J. Combin. Th. Ser. B 21 (1976), 8-20. MR 0505857 | Zbl 0348.05113

[FPP] de Fraysseix H., Pach J., Pollack R.: Small sets supporting Fáry embeddings of planar graphs. STOC 1988.

[Gav] Gavril F.: Algorithms for a maximum clique and maximum independent set of a circle graph. Networks 4 (1973), 261-273. MR 0340106

[GJ] Garey M. R., Johnson D. S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979. MR 0519066 | Zbl 0411.68039

[Kra1] Kratochvíl J.: String graphs I. The number of critical nonstring graphs is infinite. (to appear in J. Combin. Th. Ser. B). MR 1109419

[Kra2] Kratochvíl J.: String graphs II. Recognizing string graphs in NP-hard. (to appear in J. Combin. Th. Ser. B). MR 0737032

[KGK] Kratochvíl J., Goljan M., Kučera P.: String graphs. Rozpravy československé akademie věd, ŘMPV 96, No. 3, Academia, Prague, 1986. MR 0865778

[KM] Kratochvíl J., Matoušek J.: Intersections graphs of segments. submitted.

[KM2] Kratochvíl J., Matoušek J.: NP-hardness results for intersection graphs. Comment. Math. Univ. Carolinae 30 (1989), 761-773. MR 1045907

[MP] Middendorf M., Pfeiffer F.: Max clique problem in classes of string graphs. preprint Univ. Bonn (1988). MR 1189857

[S] Sinden F. W.: Topology of thin film RC circuits. Bell System Tech. J. (1966), 1639-1662. Zbl 0144.45601

[V] Valiant L. G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 30 (1981), 135-140. MR 0605722 | Zbl 0455.94046