. Proof, First suppose b(G F ) = 1 and consider a single-bend representation of G F

A. Asinowski and B. Ries, Some properties of edge intersection graphs of single-bend paths on a grid, Discrete Mathematics, vol.312, issue.2, pp.427-440, 2012.
DOI : 10.1016/j.disc.2011.10.005

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, Edge-Intersection Graphs of k-Bend Paths in Grids, Discrete Math. Theor. Comput. Sci, vol.156, issue.4, pp.1-12, 2010.
DOI : 10.1016/j.dam.2006.06.019
URL : https://hal.archives-ouvertes.fr/hal-00990425

S. Kellogg, G. S. Booth, and . Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using P Q-tree algorithms, J. Comput. System Sci, vol.13, issue.3, pp.335-379, 1976.

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.

K. Cameron, S. Chaplick, and C. T. Hò, Edge Intersection Graphs of L-Shaped Paths in Grids, Electronic Notes in Discrete Mathematics, vol.44, 2012.
DOI : 10.1016/j.endm.2013.10.057

N. Deo and N. Kumar, Multidimensional interval graphs, Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing, pp.45-56, 1994.

G. Ding, B. Oporowski, D. P. Sanders, and D. Vertigan, Partitioning Graphs of Bounded Tree-Width, Combinatorica, vol.18, issue.1, pp.1-12, 1998.
DOI : 10.1007/s004930050001

D. Epstein, M. C. Golumbic, and G. Morgenstern, Approximation Algorithms for B 1-EPG Graphs, Algorithms and Data Structures, pp.328-340
DOI : 10.1007/978-3-642-40104-6_29

A. Frank and A. Gyárfás, How to orient the edges of a graph, Combinatorics (Proc. Fifth Hungarian Colloq, pp.353-364, 1976.

R. Michael, D. S. Garey, . Johnson, I. W. Computers, and C. Freeman, A guide to the theory of NP-completeness, Series of Books in the Mathematical Sciences, 1979.

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.1381-1387, 2008.

C. Martin, M. Golumbic, M. Lipshteyn, and . Stern, Edge intersection graphs of single bend paths on a grid, Networks, vol.54, issue.3, pp.130-138, 2009.

D. Gonçalves, Caterpillar arboricity of planar graphs, Discrete Mathematics, vol.307, issue.16, pp.2112-2121, 2007.
DOI : 10.1016/j.disc.2005.12.055

D. Gonçalves and P. Ochem, On star and caterpillar arboricity, Discrete Mathematics, vol.309, issue.11, pp.3694-3702, 2009.
DOI : 10.1016/j.disc.2008.01.041

J. R. Griggs and D. B. West, Extremal Values of the Interval Number of a Graph, SIAM Journal on Algebraic Discrete Methods, vol.1, issue.1, pp.1-7, 1980.
DOI : 10.1137/0601001

F. Guldan, Some results on linear arboricity, Journal of Graph Theory, vol.32, issue.4, pp.505-509, 1986.
DOI : 10.1002/jgt.3190100408

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

S. , L. Hakimi, J. Mitchem, and E. F. Schmeichel, Star arboricity of graphs, Discrete Math, vol.149, issue.1-3, pp.93-98, 1996.

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, On the bend-number of planar and outerplanar graphs, LATIN, pp.458-469, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-01414962

M. Jiang, Recognizing d-interval graphs and d-track interval graphs, Proceedings of the 4th international conference on Frontiers in algorithmics , FAW'10, pp.160-171, 2010.
DOI : 10.1007/s00453-012-9651-5

K. Knauer and T. Ueckerdt, Simple tree-width, Midsummer Combinatorial Workshop 2012, pp.21-23, 2012.

K. Knauer and T. Ueckerdt, Three ways to cover a graph, Discrete Mathematics, vol.339, issue.2, 2012.
DOI : 10.1016/j.disc.2015.10.023
URL : https://hal.archives-ouvertes.fr/hal-01457977

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.

R. Don, A. T. Lick, and . White, k-degenerate graphs. Canad, J. Math, vol.22, pp.1082-1096, 1970.

J. Picard and M. Queyranne, A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory, Networks, vol.23, issue.2, pp.141-159, 1982.
DOI : 10.1002/net.3230120206

B. Ries, Some properties of edge intersection graphs of single bend paths on a grid, Electronic Notes in Discrete Mathematics, vol.34, issue.0, pp.29-33, 2009.
DOI : 10.1016/j.endm.2009.07.005

N. Robertson and P. D. Seymour, Graph minors ??? a survey, Surveys in combinatorics 1985, pp.153-171, 1985.
DOI : 10.1017/CBO9781107325678.009

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350

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.

B. David, D. B. Shmoys, and . West, Recognizing graphs with fixed interval number is NP-complete, Discrete Appl. Math, vol.8, issue.3, pp.295-305, 1984.

G. Vadim and . Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz No, vol.3, pp.25-30, 1964.