A. Asinowski and A. Suk, Discrete Appl. Math, vol.157, issue.14, pp.3174-3180, 2009.

T. Biedl and M. Stern, On edge-intersection graphs of k-bend paths in grids, Discrete Math. Theor. Comput. Sci, vol.12, issue.1, pp.1-12, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00990425

L. Hans and . Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret, Comput. Sci, vol.209, issue.1-2, pp.1-45, 1998.

L. Martin, M. Brady, and . Sarrafzadeh, Stretching a knock-knee layout for multilayer wiring, IEEE Trans. Comput, vol.39, issue.1, pp.148-151, 1990.

P. Hubert-de-fraysseix, P. Ossona-de-mendez, and . Rosenstiehl, On triangle contact graphs, Combin. Probab. Comput, vol.3, issue.2, pp.233-246, 1994.

S. Ehab, C. J. El-mallah, and . Colbourn, On two dual classes of planar graphs, Discrete Math, vol.80, issue.1, pp.21-40, 1990.

É. Fusy, Combinatoire des cartes planaires et applications algorithmiques, 2007.

C. Martin, M. Golumbic, M. Lipshteyn, and . Stern, Representing edge intersection graphs of paths on degree 4 trees, Discrete Math, vol.308, issue.8, pp.130-138, 2008.

D. Gonçalves and P. Ochem, On some arboricities in planar graphs, 7th International Colloquium on Graph Theory, vol.22, pp.427-432, 2005.

A. Gyárfás and D. West, Multitrack interval graphs, Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol.109, pp.109-116, 1995.

F. Harary, W. T. Trotter, and J. , On double and multiple interval graphs, J. Graph Theory, vol.3, issue.3, pp.205-211, 1979.

D. Heldt, K. Knauer, and T. Ueckerdt, Edge-intersection graphs of grid paths -the bend-number, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01457989

A. Itai and M. Rodeh, Finding a minimum circuit in a graph, SIAM Journal on Computing, vol.7, issue.4, pp.413-423, 1978.

V. Alexandr, D. B. Kostochka, and . West, Every outerplanar graph is the union of two interval graphs, Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, vol.139, pp.5-8, 1999.

K. Ko?mi?ski and E. Kinnen, Rectangular dual of planar graphs, Networks, vol.15, issue.2, pp.145-157, 1985.

Y. Lai and S. M. Leinwand, An algorithm for building rectangular floorplans, 21st Design Automation Conference (DAC '84), pp.663-664, 1984.

B. Ries, Some properties of edge intersection graphs of single bend path on a grid, European Conference on Combinatorics, Graph Theory and Applications, vol.34, pp.29-33, 2009.

R. Edward, D. B. Scheinerman, and . West, The interval number of a planar graph: three intervals suffice, J. Combin. Theory Ser. B, vol.35, issue.3, pp.224-239, 1983.

P. Ungar, On diagrams representing maps, Journal of the London Mathematical Society, vol.28, pp.336-342, 1953.