J. Barát, J. Matou?ek, and D. R. Wood, Bounded-degree graphs have arbitrarily large geometric thickness, Electron. J. Combin, vol.13, issue.1, p.14, 2006.

T. Biedl and G. Kant, A better heuristic for orthogonal graph drawings, Computational Geometry, vol.9, issue.3, pp.159-180, 1994.
DOI : 10.1016/S0925-7721(97)00026-6

J. Czyzowicz, Lattice diagrams with few slopes, Journal of Combinatorial Theory, Series A, vol.56, issue.1, pp.96-108, 1991.
DOI : 10.1016/0097-3165(91)90025-C
URL : http://doi.org/10.1016/0097-3165(91)90025-c

J. Czyzowicz, A. Pelc, I. Rival, and J. Urrutia, Crooked diagrams with few slopes, Order, vol.3, issue.3, pp.133-143, 1990.
DOI : 10.1007/BF00383762

D. Giacomo, E. Liotta, G. Montecchiani, and F. , The Planar Slope Number of Subcubic Graphs, Lecture Notes Comput. Sci, vol.8392, pp.132-143, 2014.
DOI : 10.1007/978-3-642-54423-1_12

V. Dujmovi´cdujmovi´c, D. Eppstein, M. Suderman, and D. R. Wood, Drawings of planar graphs with few slopes and segments, Computational Geometry, vol.38, issue.3, pp.194-212, 2007.
DOI : 10.1016/j.comgeo.2006.09.002

V. Dujmovi´cdujmovi´c, M. Suderman, and D. R. Wood, Graph drawings with few slopes, Computational Geometry, vol.38, issue.3, pp.181-193, 2007.
DOI : 10.1016/j.comgeo.2006.08.002

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

S. Felsner, M. Kaufmann, and P. Valtr, Bend-optimal orthogonal graph drawing in the general position model, Computational Geometry, vol.47, issue.3, pp.460-468, 2014.
DOI : 10.1016/j.comgeo.2013.03.002

H. De-fraysseix, P. Ossona-de-mendez, and J. Pach, A left-first search algorithm for planar graphs, Discrete & Computational Geometry, vol.55, issue.3-4, pp.3-4, 1995.
DOI : 10.1007/BF02574056
URL : https://hal.archives-ouvertes.fr/hal-00005623

H. De-fraysseix, P. Ossona-de-mendez, and P. Rosenstiehl, On Triangle Contact Graphs, Combinatorics, Probability and Computing, vol.81, issue.02, pp.233-246, 1994.
DOI : 10.1007/BF02122694
URL : https://hal.archives-ouvertes.fr/hal-00008999

V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidick´ylidick´y, M. Tesa? et al., The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree, Graphs and Combinatorics, vol.37, issue.4, pp.981-1005, 2013.
DOI : 10.1007/s00373-012-1157-z

G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, vol.46, issue.1, pp.4-32, 1996.
DOI : 10.1007/BF02086606
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.3851

B. Keszegh, J. Pach, and D. Pálvölgyi, Drawing Planar Graphs of Bounded Degree with Few Slopes, SIAM Journal on Discrete Mathematics, vol.27, issue.2, pp.1171-1183, 2013.
DOI : 10.1137/100815001

B. Keszegh, J. Pach, D. Pálvölgyi, and G. Tóth, Drawing cubic graphs with at most five slopes, Computational Geometry, vol.40, issue.2, pp.138-147, 2008.
DOI : 10.1016/j.comgeo.2007.05.003

K. Knauer, P. Micek, and B. Walczak, Outerplanar graph drawings with few slopes, Computational Geometry, vol.47, issue.5, pp.614-624, 2014.
DOI : 10.1016/j.comgeo.2014.01.003
URL : https://hal.archives-ouvertes.fr/hal-01457974

W. Lenhart, G. Liotta, D. Mondal, and R. I. Nishat, Planar and Plane Slope Number of Partial 2-Trees, Graph Drawing, pp.412-423, 2013.
DOI : 10.1007/978-3-319-03841-4_36

Y. Liu, A. Morgana, and B. Simeone, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, Discrete Appl. Math, vol.81, pp.1-3, 1998.

J. Misra and D. Gries, A constructive proof of Vizing's theorem, Information Processing Letters, vol.41, issue.3, pp.131-133, 1992.
DOI : 10.1016/0020-0190(92)90041-S

P. Mukkamala and D. Pálvölgyi, Drawing Cubic Graphs with the Four Basic Slopes, Graph Drawing, pp.254-265, 2012.
DOI : 10.1093/comjnl/37.2.139

P. Mukkamala and M. Szegedy, Geometric representation of cubic graphs with four directions, Computational Geometry, vol.42, issue.9, pp.842-851, 2009.
DOI : 10.1016/j.comgeo.2009.01.005

K. Nomura, S. Tayu, and S. Ueno, On the Orthogonal Drawing of Outerplanar Graphs, Computing and Combinatorics, pp.300-308, 2004.
DOI : 10.1007/978-3-540-27798-9_33

J. Pach and D. Pálvölgyi, Bounded-degree graphs can have arbitrarily large slope numbers, #N1, p.pp, 2006.

V. G. Vizing, Ob otsenke khromaticheskogo klassa p-grafa (On an estimate of the chromatic class of a p-graph), Diskret. Analiz, vol.3, pp.25-30, 1964.

G. A. Wade and J. H. Chu, Drawability of Complete Graphs Using a Minimal Slope Set, The Computer Journal, vol.37, issue.2, pp.139-142, 1994.
DOI : 10.1093/comjnl/37.2.139