N. Alon, The linear arboricity of graphs, Israel Journal of Mathematics, vol.3, issue.3, pp.311-325, 1988.
DOI : 10.1007/BF02783300

N. Alon, V. J. Teague, and A. N. 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

S. N. Bhatt, F. R. Chung, F. Thomson, . Leighton, A. L. And et al., Scheduling Tree-Dags Using FIFO Queues: A Control???Memory Trade-Off, Journal of Parallel and Distributed Computing, vol.33, issue.1, pp.55-68, 1996.
DOI : 10.1006/jpdc.1996.0024

E. Di, G. , G. Liotta, H. And, and . Meijer, Computing straight-line 3D grid drawings of graphs in linear volume, Comput. Geom, vol.32, issue.1, pp.26-58, 2005.

E. Di, G. , G. Liotta, H. Meijer, A. K. Stephen et al., Volume requirements of 3D upward drawings, Proc. 13th International Symp. on Graph Drawing (GD '05), Lecture Notes in Comput. Sci

V. Dujmovi´cdujmovi´-dujmovi´c, P. Morin, D. R. And, and . Wood, Layout of Graphs with Bounded Tree-Width, SIAM Journal on Computing, vol.34, issue.3, pp.553-579, 2005.
DOI : 10.1137/S0097539702416141

V. Dujmovi´cdujmovi´-dujmovi´c, A. P. Or, D. R. And, and . Wood, Track layouts of graphs

V. Dujmovi´cdujmovi´, D. And, and D. R. Wood, Tree-partitions of k-trees with applications in graph layout, 2002.

V. Dujmovi´cdujmovi´, D. And, and D. R. Wood, On linear layouts of graphs, Discrete Math. Theor. Comput. Sci, vol.6, issue.2, pp.339-358, 2004.

V. Dujmovi´cdujmovi´, D. And, and D. R. , Stacks, queues and tracks: Layouts of graph subdivisions, Discrete Math. Theor. Comput. Sci, vol.7, pp.155-202, 2005.

V. Dujmovi´cdujmovi´, D. And, and D. R. Wood, Three-dimensional upward grid drawings of graphs, 2005.

S. Even and A. A. Itai, QUEUES, STACKS AND GRAPHS, Proc. International Symp. on Theory of Machines and Computations, pp.71-86, 1971.
DOI : 10.1016/B978-0-12-417750-5.50011-7

J. L. Ganley, Stack and queue layouts of Halin graphs, 1995.

T. Hasunuma, Laying Out Iterated Line Digraphs Using Queues, GUISEPPE LIOTTA Proc. 11th International Symp. on Graph Drawing (GD '03), pp.202-213, 2004.
DOI : 10.1007/978-3-540-24595-7_19

L. S. Heath, F. Thomson, . Leighton, A. L. And, and . Rosenberg, Comparing Queues and Stacks As Machines for Laying Out Graphs, SIAM Journal on Discrete Mathematics, vol.5, issue.3, pp.398-412, 1992.
DOI : 10.1137/0405031

L. S. Heath and S. V. Pemmaraju, Stack and Queue Layouts of Posets, SIAM Journal on Discrete Mathematics, vol.10, issue.4, pp.599-625, 1997.
DOI : 10.1137/S0895480193252380

L. S. Heath and S. V. Pemmaraju, Stack and Queue Layouts of Directed Acyclic Graphs: Part II, SIAM Journal on Computing, vol.28, issue.5, pp.1588-1626, 1999.
DOI : 10.1137/S0097539795291550

L. S. Heath, S. V. Pemmaraju, and A. N. Trenk, Stack and Queue Layouts of Directed Acyclic Graphs: Part I, SIAM Journal on Computing, vol.28, issue.4, pp.1510-1539, 1999.
DOI : 10.1137/S0097539795280287

L. S. Heath and A. L. Rosenberg, Laying Out Graphs Using Queues, SIAM Journal on Computing, vol.21, issue.5, pp.927-958, 1992.
DOI : 10.1137/0221055

A. Imamiya, . Akihiro, and . Nozaki, Generating and sorting permutations using restricteddeques, Information Processing in Japan, vol.17, pp.80-86, 1977.

E. T. Ordman and W. Schmitt, Permutations using stacks and queues, Proc. 24th Southeastern International Conf. on Combinatorics, Graph Theory, and Computing, pp.57-64, 1993.

S. V. Pemmaraju, Exploring the Powers of Stacks and Queues via Graph Layouts, 1992.

V. R. Pratt, Computing permutations with double-ended queues, parallel stacks and parallel queues, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.268-277, 1973.
DOI : 10.1145/800125.804058

S. Rengarajan, C. E. Veni, and . Madhavan, Stack and queue number of 2-trees, Proc. 1st Annual International Conf. on Computing and Combinatorics (COCOON '95), pp.203-212, 1995.
DOI : 10.1007/BFb0030834

F. Shahrokhi, . Weiping, and . Shi, On Crossing Sets, Disjoint Sets, and Pagenumber, Journal of Algorithms, vol.34, issue.1, pp.40-53, 2000.
DOI : 10.1006/jagm.1999.1049

R. E. Tarjan, Sorting Using Networks of Queues and Stacks, Journal of the ACM, vol.19, issue.2, pp.341-346, 1972.
DOI : 10.1145/321694.321704

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

D. R. Wood, Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing, Proc. 22nd Foundations of Software Technology and Theoretical Computer Science (FST TCS '02), pp.348-359, 2002.
DOI : 10.1007/3-540-36206-1_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4989

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, The Linear Arboricity of Series-Parallel Graphs, Graphs and Combinatorics, vol.16, issue.3, pp.367-372, 2000.
DOI : 10.1007/s373-000-8299-9