A. Asinowski and A. Suk, Edge intersection graphs of systems of paths on a grid with a bounded number of bends, Discrete Applied Mathematics, vol.157, issue.14, pp.3174-3180, 2009.
DOI : 10.1016/j.dam.2009.06.015

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.

L. Hans and . Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret . Comput. Sci, vol.209, issue.12, 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, Combinatorics, Probability and Computing, vol.81, issue.02, pp.233-246, 1994.
DOI : 10.1007/BF02122694

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

´. Eric and F. , Combinatoire des cartes planaires et applications algorithmiques, 2007.
URL : https://hal.archives-ouvertes.fr/pastel-00002931

C. Martin, M. Golumbic, M. Lipshteyn, and . Stern, Representing edge intersection graphs of paths on degree 4 trees, Discrete Math Edge intersection graphs of single bend paths on a grid, pp.1381-1387, 2008.

D. Gonçalves and P. Ochem, On some arboricities in planar graphs, Electronic Notes in Discrete Mathematics, vol.22, pp.427-432, 2005.
DOI : 10.1016/j.endm.2005.06.064

A. Gyárfás and D. West, Multitrack interval graphs, Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing, 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, preprint, 2010.

A. Itai and M. Rodeh, Finding a Minimum Circuit in a Graph, SIAM Journal on Computing, vol.7, issue.4, pp.413-423, 1978.
DOI : 10.1137/0207033

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, pp.5-8, 1999.

K. Ko´zmi´nskiko´zmi´ko´zmi´nski and E. Kinnen, Rectangular dual of planar graphs, 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 paths on a grid, European Conference on Combinatorics, Graph Theory and Applications, pp.29-33, 2009.
DOI : 10.1016/j.endm.2009.07.005

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.1, issue.3, pp.336-342, 1953.
DOI : 10.1112/jlms/s1-28.3.336
URL : http://jlms.oxfordjournals.org/cgi/content/short/s1-28/3/336