A. Asinowski and A. Suk, Edge intersection graphs of systems of grid paths with bounded number of bends. Accepted to Discrete Applied Mathematics. Preliminary version available at http

J. Chalopin, D. Gonçalves, and P. Ochem, Planar graphs are in 1-string, Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA '07), pp.609-617, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00308130

C. Dangelmayr and S. Felsner, Chordal Graphs as Intersection Graphs of Pseudosegments, Graph Drawing, pp.208-219, 2007.
DOI : 10.1007/978-3-540-70904-6_21

H. De-fraysseix, P. Ossona, and . Mendez, Regular orientations, arboricity, and augmentation, Proceedings of Graph Drawing (GD'94), pp.111-118, 1994.
DOI : 10.1007/3-540-58950-3_362
URL : https://hal.archives-ouvertes.fr/hal-00005635

H. De-fraysseix, P. Ossona-de-mendez, and J. Pach, Representation of planar graphs by segments, Intuitive Geometry, vol.63, pp.109-117, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00005620

H. De-fraysseix, P. Ossona-de-mendez, and P. , On Triangle Contact Graphs, Combinatorics, Probability and Computing, vol.81, issue.02, pp.233-246, 1994.
DOI : 10.1007/BF02122694
URL : https://hal.archives-ouvertes.fr/hal-00008999

H. De-fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica, vol.13, issue.1, pp.41-51, 1990.
DOI : 10.1007/BF02122694

M. C. Golumbic, Algorithmic graph theory and perfect graphs, 2004.

M. C. Golumbic, M. Lipshteyn, and M. Stern, The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.451-461, 2008.
DOI : 10.1016/0095-8956(85)90088-7

M. C. Golumbic, M. Lipshteyn, and M. Stern, Edge intersection graphs of single bend paths on a grid, Networks, vol.16, issue.3, pp.130-138, 2009.
DOI : 10.1002/net.20305

G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, vol.46, issue.1, pp.4-32, 1996.
DOI : 10.1007/BF02086606

C. Monma and V. K. Wei, Intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.141-181, 1986.
DOI : 10.1016/0095-8956(86)90042-0

T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, 1988.

M. Schaefer, E. Sedgwick, and D. Stefanovic, Recognizing string graphs in NP, Journal of Computer and System Sciences, vol.67, issue.2, pp.365-380, 2003.
DOI : 10.1016/S0022-0000(03)00045-X