Every planar graph is the intersection graph of segments in the plane

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 631-638

  Chalopin, J́ŕmie ^a   Gonçalves, Daniel ^b  

^a CNRS   (France)

^b LIRMM   (France)

Author keywords

Intersection graphs; Planar graphs

Indexed keywords

COMPUTATION THEORY; GRAPHIC METHODS;

INTERSECTION GRAPH; PHD THESIS; PLANAR GRAPH; PRINCETON UNIVERSITY; VERTEX SET;

GRAPH THEORY;

EID: 70350671687     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536500     Document Type: Conference Paper

References (18)

1. J. Chalopin, D. Gonçalves, and P. Ochem. Planargraphs are in 1-string. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete Algorithms, pages 609-617, 2007.
2. J. Czyzowicz, E. Kranakis, and J. Urrutia. A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments. Inform. Process. Lett., 66(3):125-126, 1998.
3. N. de Castro, F. J. Cobos, J. C. Dana, A. Márquez, and M. Noy. Triangle-free planar graphs as segment intersection graphs. J. Graph Algorithms Appl., 6:no. 1, 7-26 (electronic), 2002. Graph drawing and representations (Prague, 1999).
4. H. de Fraysseix, P. O. de Mendez, and J. Pach. Representation of planar graphs by segments. In Intuitive geometry (Szeged, 1991), volume 63 of Colloq. Math. Soc. János Bolyai, pages 109-117. North-Holland, Amsterdam, 1994.
5. H. de Fraysseix and P. Ossona de Mendez. Representations by contact and intersection of segments. Algorithmica, 47(4):453-463, 2007.
6. P. O. de Mendez. retrieved Mar. 2006.
7. G. Ehrlich, S. Even, and R. E. Tarjan. Intersection graphs of curves in the plane. J. Combinatorial Theory Ser. B, 21(1):8-20, 1976.
8. D. Gonçalves. Edge-partition of planar graphs into two outerplanar graphs. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 504-512, 2005.
9. D. Gonçalves. A planar linear hypergraph whose edges cannot be represented as straight line segments. European J. Combin., 30:280-282, 2009.
10. I.-A. Hartman, I. Newman, and R. Ziv. On grid intersection graphs. Discrete Math., 87(1):41-52, 1991.
11. P. Koebe. Kontaktprobleme der konformen abbildung. Ber. Verh. Sachs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse, 88:141-164, 1936.
12. J. Kratochvíl. String graphs. ii. recognizing string graphs is np-hard. J. Combin. Theory. Ser. B, 52:67-78, 1991.
13. J. Kratochvi̧l. Geometric representations of graphs, 2005. Graduate Course, Barcelona, april 2005. Retrieved Jan. 2006.
14. J. Kratochvíl and J. Matoušek. Intersection graphs of segments. J. Combin. Theory. Ser. B, 62:180-181, 1994.
15. J. Pach and J. Solymosi. Crossing patterns of segments. J. Combin. Theory Ser. A, 96:316-325, 2001.
16. E. Scheinerman. Intersection classes and multiple intersection parameters of graphs. PhD thesis, Princeton University, 1984.
17. D. West. Open problems. SIAM J. Discrete Math. Newslett., 2(1):10-12, 1991.
18. H. Whitney. A theorem on graphs. Ann. of Math. (2), 32(2):378-390, 1931.