Representing graphs by disks and balls (a survey of recognition-complexity results)

Discrete Mathematics

Volumn 229, Issue 1-3, 2001, Pages 101-124

  Hliněný, Petr ^a,b   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346609978     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00204-1     Document Type: Article

References (41)

1. S. Bhatt, S. Cosmadakis, The complexity of minimizing wire lengths in VLSI layouts, Inform. Process. Lett. 25 (1987) 263-267.
2. K.S. Booth, G.S. Lucker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. Systems Sci. 13 (1976) 255-265.
3. A. Bouchet, Reducing prime graphs and recognizing circle graphs, Combinatorica 7 (1987) 243-254.
4. A. Brandstadt, V.B. Le, J.P. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 1999.
5. H. Breu, H.B. Hunt III, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995) 59-68.
6. H. Breu, D.G. Kirkpatrick, On the complexity of recognizing intersection and touching graphs of discs, 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. 88-98.
7. H. Breu, D.G. Kirkpatrick, Unit disk graph recognition is NP-hard, Comput. Geom. 9 (1998) 3-24.
8. N. de Castro, F.J. Cobos, J.C. Dana, A. Márquez, M. Noy, Triangle-free planar graphs as segment intersection graphs, in: J. Kratochvíl (Ed.), Proceedings Graph Drawing '99, Štiřín Castle, Czech Rep., September 1999, Lecture Notes in Computer Science Vol. 1731, Springer, Berlin, 1999, pp. 341-350.
9. B.N. Clark, C.J. Colbourn, D.S. Johnson, Unit disk graphs, Discrete Math. 86 (1990) 165-177.
10. J.H. Conway, N.J.A. Sloane, Sphere Packings, Lattices and Groups, 3rd Edition, Grundlehren der Mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics, Vol. 290, Springer, New York, 1999 (With additional contributions by E. Bannai, R.E. Borcherds, J. Leech, S.P. Norton, A.M. Odlyzko, R.A. Parker, L. Queen and B.B. Venkov).
11. P. Eades, S. Whitesides, The logic engine and the realization problem for nearest neighbor graphs, Theoret. Comput. Sci. 169 (1996) 23-37.
12. G. Ehrlich, S. Even, R.E. Tarjan, Intersection graphs of curves in the plane, J. Combin. Theory Ser. B 21 (1976) 8-20.
13. H. de Fraysseix, A characterization of circle graphs, European J. Combin. 5 (1984) 223-238.
14. H. de Fraysseix, P. Ossona de Mendez, J. Pach, Representation of planar graphs by segments, Intuitive Geometry, Szeged, 1991, Colloquim Mathematical Society, Janos Bolyai 63, 1994, pp. 109-117.
15. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979.
16. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
17. A. Gräf, M. Stumpf, G. Weißenfels, On coloring unit disk graphs, Algorithmica 20 (1998) 277-293.
18. W.K. Halle, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
19. 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.
20. P. Hliněný, Touching graphs of unit balls, in: G. DiBattista (Ed.), Graph Drawing, Proceedings Graph Drawing '97, Rome, September, Lecture Notes in Computer Science, Vol. 1353, Springer, Berlin, 1997, pp. 350-358.
21. P. Hliněný, The maximal clique and colourability of curve contact graphs, Discrete Appl. Math. 81 (1998) 59-68.
22. P. Hliněný, Classes and recognition of curve contact graphs, J. Combin. Theory Ser. B 74 (1998) 87-103.
23. P. Hliněný, Contact graphs of line segments are NP-complete, Discrete Math. (2001) to appear.
24. P. Koebe, Kontaktprobleme der konformen Abbildung, Berichte über die Verhand-lungen der Sächsischen, Akad. Wiss., Math.-Phys. Klasse 88 (1936) 141-164.
25. J. Kratochvíl, String graphs I: the number of critical nonstring graphs is infinite, J. Combin. Theory Ser. B 52 (1991) 53-66.
26. J. Kratochvíl, String graphs II: recognizing string graphs is NP-hard, J. Combin. Theory Ser. B 1 (1991) 67-78.
27. J. Kratochvíl, A special planar satisfiability problem and a consequence of its NP-completeness, Discrete Appl. Math. 52 (1994) 233-252.
28. J. Kratochvíl, Intersection graphs of noncrossing arc-connected sets in the plane, Proceedings Graph Drawing '96, Berkeley, September 1996; Lecture Notes in Computer Science, Vol. 1190, Springer, Berlin, 1997.
29. J. Kratochvíl, J. Matoušek, String graphs requiring exponential representations, J. Combin. Theory Ser. B 52 (1991) 1-4.
30. J. Kratochvíl, J. Matoušek, Intersection graphs of segments, J. Combin. Theory Ser. B 62 (1994) 289-315.
31. 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.
32. T.A. McKee, F.R. McMorris, Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 1999.
33. B. Mohar, A polynomial time circle packing algorithm, Discrete Math. 117 (1993) 257-263.
34. B. Mohar, Circle packings of maps in polynomial time, European J. Combin. 7 (1997) 785-805.
35. J. Pach, G. Tóth, On the independence number of coin graphs, Geombinatorics 6 (1996) 30-33.
36. R. Pollack, Increasing the minimum distance of a set of points, J. Combin. Theory Ser. A 40 (1985) 450.
37. J. Renegar, On the computational complexity and geometry of the first order theory of reals, J. Symbolic Comput. (1992).
38. H. Sachs, Coin graphs, polyhedra, and conformal mapping, Algebraic and Topological Methods in Graph Theory, Lake Bled, 1991; Discrete Math. 134 (1994) 133-138.
39. F.W. Sinden, Topology of thin film RC-circuits, Bell System Tech. J. (1966) 1639-1662.
40. C. Thomassen, Presentation at Graph Drawing '93, Paris, 1993.
41. M.S. Waterman, J.R. Griggs, Interval graphs and maps of DNA, Bull. Math. Biol. 48 (1986) 189-195.