A. Aggarwal, M. Klawe, and P. Shor, Multilayer grid embeddings for VLSI, Algorithmica, vol.32, issue.2, pp.129-151, 1991.
DOI : 10.1007/BF01759038

J. Akiyama, G. Exoo, and F. Harary, Covering and packing in graphs. III. Cyclic and acyclic invariants, Math. Slovaca, vol.30, issue.4, pp.405-417, 1980.

J. Akiyama and M. Kano, Path factors of a graph, Graphs and applications, pp.1-21, 1982.

I. Algor and N. Alon, The star arboricity of graphs, Discrete Math, Graph theory and combinatorics, pp.11-22, 1988.

C. Noga-alon, B. Mcdiarmid, S. Reed, and . Arboricity, Star arboricity, Combinatorica, vol.39, issue.4, pp.375-380, 1992.
DOI : 10.1007/BF01305230

N. Alon and J. H. Spencer, The probabilistic method Wiley-Interscience Series in Discrete Mathematics and Optimization, 2008.

N. Alon, V. J. Teague, and N. C. Wormald, Linear Arboricity and Linear k-Arboricity of Regular Graphs, Graphs and Combinatorics, vol.17, issue.1, pp.11-16, 2001.
DOI : 10.1007/PL00007233

W. Lowell and . Beineke, Decompositions of complete graphs into forests, Publ. Math. Inst. Hung. Acad. Sci., Ser. A, vol.9, pp.589-594, 1965.

W. Lowell and . Beineke, A survey of packings and coverings of graphs, The Many Facets of Graph Theory, Proc. Conf., Western Mich. Univ, pp.45-53, 1968.

A. Below, A. D. Jesús, J. Loera, and . Richter-gebert, The complexity of finding small triangulations of convex 3-polytopes, Journal of Algorithms, vol.50, issue.2, pp.134-167, 2004.
DOI : 10.1016/S0196-6774(03)00092-0

A. Butman, D. Hermelin, M. Lewenstein, and D. Rawitz, Optimization problems in multiple-interval graphs, ACM Transactions on Algorithms, vol.6, issue.2, pp.1-4018, 2010.
DOI : 10.1145/1721837.1721856

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

J. Dong and Y. Liu, On the decomposition of graphs into complete bipartite graphs, Graphs Combin, pp.255-262, 2007.

V. Dujmovi´cdujmovi´c and D. R. Wood, Graph Treewidth and Geometric Thickness Parameters, Discrete & Computational Geometry, vol.37, issue.4, pp.641-670, 2007.
DOI : 10.1007/s00454-007-1318-7

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

G. Fan, Covers of eulerian graphs, Journal of Combinatorial Theory, Series B, vol.89, issue.2, pp.173-187, 2003.
DOI : 10.1016/S0095-8956(03)00068-6

J. Fiala, . Van-bang, and . Le, The subchromatic index of graphs, Tatra Mountain Mathematical Publications, vol.36, pp.129-146, 2007.

C. Peter, P. L. Fishburn, and . Hammer, Bipartite dimensions and bipartite degrees of graphs, Discrete Math, pp.127-148, 1996.

D. Gonçalves, Caterpillar arboricity of planar graphs, Discrete Math, pp.2112-2121, 2007.

D. Gonçalves and P. Ochem, On star and caterpillar arboricity, Discrete Math, pp.3694-3702, 2009.

N. Graham and F. Harary, Covering and packing in graphs???V, Computers & Mathematics with Applications, vol.15, issue.4, pp.267-270, 1988.
DOI : 10.1016/0898-1221(88)90211-8

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, pp.93-98, 1996.

F. Harary, COVERING AND PACKING IN GRAPHS, I., Annals of the New York Academy of Sciences, vol.142, issue.1, pp.198-205, 1970.
DOI : 10.1111/j.1749-6632.1970.tb56470.x

F. Harary and A. J. Schwenk, Evolution of the path number of a graph: Covering and packing in graphs. II, Graph theory and computing, pp.39-45, 1972.

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, Discrete Applied Mathematics, vol.167, pp.144-162, 2014.
DOI : 10.1016/j.dam.2013.10.035
URL : https://hal.archives-ouvertes.fr/hal-01457989

I. Holyer, The NP-Completeness of Edge-Coloring, SIAM Journal on Computing, vol.10, issue.4, pp.718-720, 1981.
DOI : 10.1137/0210055

B. Jackson and G. Ringel, Splittings of graphs on surfaces, Graphs and applications, pp.203-219, 1982.

R. Javadi, Z. Maleki, and B. Omoomi, Local Clique Covering of Graphs, ArXiv 1210, p.6965, 2012.

M. Jiang, Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots, IEEE/ACM Trans. Comput. Biol. Bioinformatics, vol.7, pp.323-332, 2010.
DOI : 10.1007/978-3-540-72870-2_38

D. Joseph, J. Meidanis, and P. Tiwari, Determining DNA sequence similarity using maximum independent set algorithms for interval graphs, Algorithm Theory SWAT '92, pp.326-337, 1992.
DOI : 10.1007/3-540-55706-7_29

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

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.

L. Lovász, On covering of graphs, Theory of Graphs (Proceedings of the Coloquium held at Tihanx, Hungary, pp.231-236, 1966.

K. G. Milans, D. Stolee, and D. B. West, Ordered Ramsey theory and track representations of graphs, Journal of Combinatorics, vol.6, issue.4, 2015.
DOI : 10.4310/JOC.2015.v6.n4.a3

P. Mutzel, T. Odenthal, and M. Scharbrodt, The thickness of graphs: a survey, Graphs Combin, pp.59-73, 1998.

C. J. St and . Nash-williams, Decomposition of finite graphs into forests, J. London Math. Soc, vol.39, p.12, 1964.

J. Petersen, Die Theorie der regul??ren graphs, Acta Mathematica, vol.15, issue.0, pp.193-220, 1891.
DOI : 10.1007/BF02392606

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

T. Pinto, Biclique covers and partitions., Electron, J. Comb, vol.21, issue.1, p.12, 2014.

S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio networks, ACM SIGCOMM Computer Communication Review, vol.22, issue.4, pp.211-222, 1992.
DOI : 10.1145/144191.144283
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.8100

N. Robertson and P. D. Seymour, Graph minors?a survey, Surveys in combinatorics, London Math. Soc. Lecture Note Ser, vol.103, pp.153-171, 1985.

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.

C. Thomas and . Shermer, On rectangle visibility graphs. iii. external visibility and complexity, CCCG'96, pp.234-239, 1996.

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.

P. V. Skums, S. V. Suzdal, and R. I. Tyshkevich, Edge intersection graphs of linear 3- uniform hypergraphs, Discrete Math, pp.3500-3517, 2009.

D. B. West, A short proof of the degree bound for interval number, Discrete Math, pp.309-310, 1989.

H. Whitney, Congruent Graphs and the Connectivity of Graphs, American Journal of Mathematics, vol.54, issue.1, pp.150-168, 1932.
DOI : 10.2307/2371086

J. Wu, On the linear arboricity of planar graphs, Journal of Graph Theory, vol.175, issue.2, pp.129-134, 1999.
DOI : 10.1002/(SICI)1097-0118(199906)31:2<129::AID-JGT5>3.0.CO;2-A

J. Wu and Y. Wu, The linear arboricity of planar graphs of maximum degree seven is four, Journal of Graph Theory, vol.31, issue.3, pp.210-220, 2008.
DOI : 10.1002/jgt.20305