Contact graphs of curves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1027, Issue , 1996, Pages 312-323

  Hliněný, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

CONTACT GRAPHS; GEOMETRICAL OBJECTS; INTERSECTION GRAPH; LINE SEGMENT; NP COMPLETE; NP-HARD; PLANAR GRAPH;

DRAWING (GRAPHICS);

EID: 84947906543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021814     Document Type: Conference Paper

References (17)

1. K. S. Booth, G. S. Lucker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comp. Systems Sei. 13 (1976), 255-265.
2. A. Bouchet, Reducing prime graphs and recognizing circle graphs, Combinatorica 7 (1987), 243-254.
3. G. Ehrlich, S. Even, R.E. Tarjan, Intersection graphs of curves in the plane, J. of Comb. Theory Ser. B 21 (1976), 8-20.
4. H. de Fraysseix, P.O. de Mendez, J. Pach, Representation of planar graphs by segments, 63. Intuitive Geometry (1991), 110-117.
5. H. de Fraysseix, P.O. de Mendez, P. Rosenstiehl, On triangle contact graphs, Combinatorics, Probability and Computing 3 (1994), 233-246.
6. H. de Fraysseix, P.O. de Mendez, to appear.
7. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York 1979.
8. F. Gavril, Algorithms for a maximum clique and maximum independent set of a circle graph, Networks 4 (1973), 261-273.
9. P. Hliněný, Contact graphs of curves, KAM Preprint Series 95-285, Dept, of Applied Math., Charles University, Czech rep., 1995.
10. P. Koebe, Kontaktprobleme der konformen Abbildung, Berichte über die Verhandlungen der Sächsischen, Akad. d. Wiss., Math.-Physische Klasse 88 (1936), 141-164.
11. J. Kratochvfl, String graphs II: Recognizing string graphs is NP-hard, J. of Comb. Theory Ser. B 1 (1991), 67-78.
12. J. Kratochvfl, J. Matoušek, Intersection graphs of segments, J. of Comb. Theory Ser. B 2 (1994), 289-315.
13. J. Kratochvfl, J. Matoušek, String graphs requiring exponential representations, J. of Comb. Theory Ser. B 2 (1991), 1-4.
14. C.B. Lekkerkerkei, J.C. Boland, Representation of finite graphs by a set of intervals on the real line, Fund. Math. 51 (1962), 45-64.
15. S. Roberts, On the boxicity and cubicity of a graph, in "Recent Progresses in Combinatorics" 301-310, Academic Press, New York, 1969.
16. F.W. Sinden, Topology of thin film RC-circuits, Bell System Techn. J. (1966), 1639-1662.
17. C. Thomassen, presentation at Graph Drawing'93, Paris, 1993.