The maximal clique and colourability of curve contact graphs

Discrete Applied Mathematics

Volumn 81, Issue 1-3, 1998, Pages 59-68

  Hliněný, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041105121     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(97)00075-9     Document Type: Article

References (13)

1. G. Ehrlich, S. Even, R.E. Tarjan, Intersection graphs of curves in the plane, J. Combin. Theory Ser. B 21 (1976) 8-20.
2. H. de Fraysseix, P.O. de Mendez, J. Pach, Representation of planar graphs by segments, Intuitive Geometry 63 (1991) 110-117.
3. H. de Fraysseix, P.O. de Mendez, P. Rosenstiehl, On triangle contact graphs, Combin. Probab. Comput. 3 (1994) 233-246.
4. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
5. P. Hliněný, Contact graphs of curves, KAM Preprint Series 95-285, Dept. of Applied Math., Charles University, Czech Rep., 1995.
6. P. Hliněný, Contact graphs of curves (extended abstract), Proc. Graph Drawing'95, Lecture Notes in Computer Science, vol. 1027, Springer, Berlin, 1996, pp. 312-323.
7. P. Hliněný, Classes and recognition of curve contact graphs, J. Combin. Theory Ser. B, submitted.
8. P. Koebe, Kontaktprobleme der konformen Abbildung, Berichte über die Verhandlungen der Sächsischen, Akad. d. Wiss., Math.-Physische Klasse 88 (1936) 141-164.
9. J. Kratochvíl, String graphs II: recognizing string graphs is NP-hard, J. Combin. Theory Ser. B 1 (1991) 67-78.
10. J. Kratochvíl, J. Matoušek, Intersection graphs of segments, J. Combin. Theory Ser. B 2 (1994) 289-315.
11. J. Kratochvíl, J. Matoušek, String graphs requiring exponential representations, J. Combin. Theory Ser. B 2 (1991) 1-4.
12. 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.
13. C. Thomassen, Presentation at Graph Drawings'93, Paris, 1993.