Contact graphs of line segments are NP-complete

Discrete Mathematics

Volumn 235, Issue 1-3, 2001, Pages 95-106

  Hliněný, Petr ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035962748     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00263-6     Document Type: Article

References (18)

1. A. Bouchet, Reducing prime graphs and recognizing circle graphs, Combinatorica 7 (1987) 243-254.
2. N. de Castro, F.J. Cobos, J.C. Dana, A. Márquez, M. Noy, Triangle-free planar graphs as segment intersection graphs, Proceedings Graph Drawing 99, Lecture Notes in Computer Science Vol. 1731, Springer, Berlin, 1999, pp. 341-350.
3. H. de Fraysseix, P. Ossona de Mendez, J. Pach, Representation of planar graphs by segments, Intuitive Geom. 63 (1991) 110-117.
4. H. de Fraysseix, P. Ossona de Mendez, Stretchability of Jordan arc contact systems, KAM Preprint Series 98-387, 1998, to appear.
5. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
6. P. Hliněný, Contact graphs of curves, KAM Preprint Series 95-285, Department of Applied Mathematics, Charles University, Czech Republic, 1995.
7. P. Hliněný, Contact graphs of curves (extended abstract), in: F.J. Brandenburg (Ed.), Graph Drawing, Proceedings Graph Drawing '95, Passau, September 1995; Lecture Notes in Computer Science, vol. 1027, Springer, Berlin, 1996, pp. 312-323.
8. P. Hliněný, The maximal clique and colourability of curve contact graphs, Discrete Appl. Math. 81 (1998) 59-68.
9. P. Hliněný, The classes and recognition of curve contact graphs, J. Combin. Theory Ser. B 74 (1998) 87-103.
10. P. Koebe, Kontaktprobleme der konformen Abbildung, Berichte über die Verhandlungen der Sächsischen, Akad. d. Wiss., Math.-Phys. Klasse 88 (1936) 141-164.
11. J. Kratochvíl, String graphs II: Recognizing string graphs is NP-hard, J. Combin. Theory Ser. B 1 (1991) 67-78.
12. J. Kratochvíl, J. Matoušek, Intersection graphs of segments, J. Combin. Theory Ser. B 2 (1994) 289-315.
13. J. Kratochvíl, J. Matoušek, String graphs requiring exponential representations, J. Combin. Theory Ser. B 2 (1991) 1-4.
14. M. Las Vergnas, P. Ossona de Mendez, On barycentric representation of graphs, in preparation.
15. C.B. Lekkerkerker, J.C. Boland, Representation of finite graphs by a set of intervals on the real line, Fund. Math. 51 (1962) 45-64.
16. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.
17. R. Tamassia, I.G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986) 321-341.
18. C. Thomassen, presentation at Graph Drawing '93, Paris, 1993.