de Castro, N., Cobos, F., Dana, J.C., Márquez, A., Noy, M.: Triangle-free planar graphs as segment intersection graphs. J. Graph Algorithms Appl. 6(1), 7–26 (2002)
MathSciNet
CrossRef
Google Scholar
Chalopin, J., Gonçalves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, pp. 631–638 (2009)
Google Scholar
Czyzowicz, J., Kranakis, E., Urrutia, J.: 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)
MathSciNet
CrossRef
Google Scholar
Felsner, S.: Triangle contact representations. In: Midsummer Combinatorial Workshop (2009)
Google Scholar
de Fraysseix, H., Ossona de Mendez, P.: Representations by contact and intersection of segments. Algorithmica 47, 453–463 (2007)
MathSciNet
CrossRef
Google Scholar
de Fraysseix, H., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments. Colloq. Math. Soc. János Bolyai 63, 109–117 (1994). Intuitive Geometry (Szeged, 1991)
MathSciNet
MATH
Google Scholar
Gonçalves, D., Isenmann, L., Pennarun, C.: Planar Graphs as L-intersection or L-contact graphs. In: Proceedings of SODA, pp. 172–184 (2018)
CrossRef
Google Scholar
Hartman, I.B.-A., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math. 87(1), 41–52 (1991)
MathSciNet
CrossRef
Google Scholar
Kratochvíl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Combin. Theory. Ser. B 52, 67–78 (1991)
MathSciNet
CrossRef
Google Scholar
Kratochvíl, J., Matoušek, J.: Intersection graphs of segments. J. Combin. Theory. Ser. B 62, 180–181 (1994)
MathSciNet
CrossRef
Google Scholar
Máčajová, E., Raspaud, A., Škoviera, M.: The chromatic number of a signed graph. Electr. J. Comb. 23(1), P1, 1–14 (2016)
Google Scholar
Pach, J., Solymosi, J.: Crossing patterns of segments. J. Combin. Theory. Ser. A 96, 316–325 (2001)
MathSciNet
CrossRef
Google Scholar
Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs. Ph.D., Thesis, Princeton University (1984)
Google Scholar
Scheinerman, E.R.: Private communication to D. West (1993)
Google Scholar
West, D.: Open problems. SIAM J. Discrete Math. Newslett. 2(1), 10–12 (1991)
Google Scholar