]. Bar´at, J. Matou?ekmatou?matou?ek, D. R. And, and . Wood, Bounded-degree graphs have arbitrarily large geometric thickness, Electron. J. Combin, vol.13, issue.11, p.3, 2006.

E. A. Bender, E. Rodney, and . Canfield, The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978.
DOI : 10.1016/0097-3165(78)90059-6

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), pp.101-110, 2006.

V. Dujmovi´cdujmovi´-dujmovi´c, P. Morin, D. R. And, and . Wood, Layout of graphs with bounded tree-width

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, 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. Wood, Three-dimensional grid drawings with sub-quadratic volume, Towards a Theory of Geometric Graphs of Contemporary Mathematics, pp.55-66, 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. Order, pp.1-20, 2006.

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

S. Felsner, G. Liotta, S. K. And, and . Wismath, Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions, Journal of Graph Algorithms and Applications, vol.7, issue.4, pp.363-398, 2003.
DOI : 10.7155/jgaa.00075

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

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 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.

S. Jukna, Extremal combinatorics: with applications in computer science. Texts in Theoretical Computer Science, 2001.

A. Marcus and A. Tardos, Excluded permutation matrices and the Stanley???Wilf conjecture, Journal of Combinatorial Theory, Series A, vol.107, issue.1, pp.153-160, 2004.
DOI : 10.1016/j.jcta.2004.04.002

B. D. Mckay, Asymptotics for symmetric 0-1 matrices with prescribed row sums, Ars Combin, vol.19, issue.A, pp.15-25, 1985.

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

G. Tardos, On 0???1 matrices and small excluded submatrices, Journal of Combinatorial Theory, Series A, vol.111, issue.2, pp.266-288, 2005.
DOI : 10.1016/j.jcta.2004.11.015

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

D. R. Wood, Queue layouts of graph products and powers, Discrete Math. Theor. Comput. Sci, vol.7, issue.1, pp.255-268, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00959041

N. Wormald, Some problems in the enumeration of labelled graphs, Bulletin of the Australian Mathematical Society, vol.21, issue.01, 1978.
DOI : 10.1017/S0004972700011436