A. Radhika-ramamurthi, Coloring with no 2-colored P 4 's. Electron, J. Combin, pp.11-26, 2004.

N. Alon and A. T. Marshall, Homomorphisms of edge-colored graphs and Coxeter groups, Journal of Algebraic Combinatorics, vol.8, issue.1, pp.5-13, 1998.
DOI : 10.1023/A:1008647514949

N. Alon, C. Mcdiarmid, and A. Bruce-reed, Acyclic coloring of graphs, Random Structures & Algorithms, vol.14, issue.3, pp.277-288, 1991.
DOI : 10.1002/rsa.3240020303

N. Alon, B. Mohar, D. P. And, and . Sanders, On acyclic colorings of graphs on surfaces, Israel Journal of Mathematics, vol.14, issue.1, pp.273-283, 1996.
DOI : 10.1007/BF02762708

D. M. Berman, Critical graphs for acyclic colorings, Bulletin canadien de math??matiques, vol.21, issue.1, pp.115-116, 1978.
DOI : 10.4153/CMB-1978-018-x

F. R. Bernhart and P. C. Kainen, The book thickness of a graph, Journal of Combinatorial Theory, Series B, vol.27, issue.3, pp.320-331, 1979.
DOI : 10.1016/0095-8956(79)90021-2

R. Blankenship, Book Embeddings of Graphs, 2003.

R. Blankenship and B. Oporowski, Drawing subdivisions of complete and complete bipartite graphs on books, 1999.

R. Blankenship and B. Oporowski, Book embeddings of graphs and minor-closed classes, Proc. 32nd Southeastern International Conf. on Combinatorics, Graph Theory and Computing, 2001.

O. V. Borodin, On acyclic colorings of planar graphs, Discrete Mathematics, vol.25, issue.3, pp.211-236, 1979.
DOI : 10.1016/0012-365X(79)90077-3

O. V. Borodin, D. G. Fon-der-flaass, A. V. Kostochka, A. Ras-paud, and A. Sopena, Acyclic list 7-coloring of planar graphs, Journal of Graph Theory, vol.120, issue.2, pp.83-90, 2002.
DOI : 10.1002/jgt.10035
URL : https://hal.archives-ouvertes.fr/hal-00307589

O. V. Borodin, A. V. Kostochka, J. N?-set?ilset?set?il, A. Raspaud, . Andéric et al., On the maximum average degree and the oriented chromatic number of a graph, Discrete Mathematics, vol.206, issue.1-3
DOI : 10.1016/S0012-365X(98)00393-8
URL : https://hal.archives-ouvertes.fr/hal-00306484

O. V. Borodin, A. V. Kostochka, A. Raspaud, and A. Sopena, Acyclic colouring of 1-planar graphs, Discrete Applied Mathematics, vol.114, issue.1-3, pp.29-41, 2001.
DOI : 10.1016/S0166-218X(00)00359-0

O. V. Borodin, A. V. Kostochka, and A. D. Woodall, Acyclic Colourings of Planar Graphs with Large Girth, Journal of the London Mathematical Society, vol.60, issue.2, pp.344-352, 1999.
DOI : 10.1112/S0024610799007942

P. Bose, J. Czyzowicz, P. Morin, D. R. And, and . Wood, The Maximum Number of Edges in a Three-Dimensional Grid-Drawing, Journal of Graph Algorithms and Applications, vol.8, issue.1, pp.21-26, 2004.
DOI : 10.7155/jgaa.00079

A. Branst¨adtbranst¨-branst¨adt, . Van-bang, . Le, J. P. And, and . Spinrad, Graph classes: a survey, SIAM, 1999.

M. I. Bu? and . In, Every 4-valent graph has an acyclic 5-coloring

T. Calamoneri and A. Sterbini, 3D straight-line grid drawing of 4-colorable graphs, Information Processing Letters, vol.63, issue.2, pp.97-102, 1997.
DOI : 10.1016/S0020-0190(97)00098-7

R. F. Cohen, P. Eades, T. Lin, and A. Frank, Three-dimensional graph drawing, Algorithmica, vol.5, issue.5, pp.199-208, 1996.
DOI : 10.1007/BF02522826

E. Di and G. , Drawing series-parallel graphs on restricted integer 3D grids, pp.238-246

E. Di, G. , G. Liotta, H. And, and . Meijer, 3D straight-line drawings of k-trees, 2003.

E. Di, G. , G. Liotta, S. K. And, and . Wismath, Drawing series-parallel graphs on a box, Proc. 14th Canadian Conf. on Computational Geometry (CCCG '02), pp.149-153, 2002.

E. Di, G. And, and . Meijer, Track drawings of graphs with constant queue number, pp.214-225

M. B. Dillencourt, D. Eppstein, and A. D. Hirschberg, Geometric Thickness of Complete Graphs, Journal of Graph Algorithms and Applications, vol.4, issue.3, pp.5-17, 2000.
DOI : 10.7155/jgaa.00023

R. P. Dilworth, A Decomposition Theorem for Partially Ordered Sets, The Annals of Mathematics, vol.51, issue.1, pp.161-166, 1950.
DOI : 10.2307/1969503

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

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, D. R. Vida, D. R. Dujmovi´c, and . Wood, Layouts of graph subdivisions Stacks, queues and tracks: Layouts of graph subdivisions, Tech, Proc. 12th International Symp. on Graph Drawing, 2003.

C. A. Duncan, D. Eppstein, S. G. And, and . Kobourov, The geometric thickness of low degree graphs, Proceedings of the twentieth annual symposium on Computational geometry , SCG '04, pp.340-346, 2004.
DOI : 10.1145/997817.997868

D. Eppstein, Separating geometric thickness from book thickness. arXiv.org:math, 2001.

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

G. Fertin, E. Godard, and A. Andréandr´andré-raspaud, Minimum feedback vertex set and acyclic coloring, Information Processing Letters, vol.84, issue.3, pp.131-139, 2002.
DOI : 10.1016/S0020-0190(02)00265-X
URL : https://hal.archives-ouvertes.fr/hal-00307785

G. Fertin, A. Raspaud, and A. Bruce-reed, Star coloring of graphs, Journal of Graph Theory, vol.3, issue.3, pp.163-182, 2004.
DOI : 10.1002/jgt.20029
URL : https://hal.archives-ouvertes.fr/hal-00307788

B. Gr¨unbaumgr¨-gr¨unbaum, Acyclic colorings of planar graphs, Israel Journal of Mathematics, vol.58, issue.2, pp.390-408, 1973.
DOI : 10.1007/BF02764716

A. Andr´as, . Gy´arfgy´arf´, and . Gy´arf´as, Problems from the world surrounding perfect graphs, Zastos. Mat, vol.19, issue.3- 4, pp.413-441, 1987.

F. Harary and A. Schwenk, A new crossing number for bipartite graphs, Utilitas Math, vol.1, pp.203-209, 1972.

T. Hasunuma, Laying Out Iterated Line Digraphs Using Queues, pp.202-213
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 A. L. Rosenberg, Laying Out Graphs Using Queues, SIAM Journal on Computing, vol.21, issue.5, pp.927-958, 1992.
DOI : 10.1137/0221055

P. C. Kainen, Thickness and coarseness of graphs, Abhandlungen aus dem Mathematischen Seminar der Universit??t Hamburg, vol.23, issue.1, pp.88-95, 1973.
DOI : 10.1007/BF02992822

A. V. Kostochka, L. S. Mel, and . Nikov, Note to the paper of Gr??nbaum on acyclic colorings, Discrete Mathematics, vol.14, issue.4, pp.403-406, 1976.
DOI : 10.1016/0012-365X(76)90075-3

A. V. Kostochka, ´. Eric-sopena, X. And, and . Zhu, Acyclic and oriented chromatic numbers of graphs, Journal of Graph Theory, vol.24, issue.4, pp.331-340, 1997.
DOI : 10.1002/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-P

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

J. N?, P. Set?ilset?set?il, S. Ossona-de-mendez-boris-aronov, J. ´. Basu, A. M. Pach et al., Colorings and homomorphisms of minor closed classes The Goodman-Pollack Festschrift, Discrete and Computational Geometry of Algorithms and Combinatorics Three-dimensional grid drawings of graphs, pp.651-664, 2003.

B. In, J. E. Chazelle, A. Goodman, and . Richard-pollack, Advances in discrete and computational geometry, of Contemporary Mathematics, pp.251-255, 1999.

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

A. Raspaud and A. Sopena, Good and semi-strong colorings of oriented planar graphs, Information Processing Letters, vol.51, issue.4, pp.171-174, 1994.
DOI : 10.1016/0020-0190(94)00088-3

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-2121, 1995.
DOI : 10.1007/BFb0030834

D. R. Wood, Acyclic, star and oriented colourings of graph subdivisions, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00959027

D. R. Wood, Grid drawings of k-colourable graphs, Computational Geometry, vol.30, issue.1, pp.25-28, 2005.
DOI : 10.1016/j.comgeo.2004.06.001