P. Erd?-os and G. Szekeres, A combinatorial problem in geometry, Compos. Math, vol.2, pp.463-470, 1935.

I. Fáry, On straight-line representation of planar graphs, Acta Sci. Math. (Szeged), vol.11, pp.229-233, 1948.

X. Goaoc, J. Kratochvíl, Y. Okamoto, C. Shin, and A. Wolff, Moving Vertices to Make Drawings Plane, 2007.
DOI : 10.1007/978-3-540-77537-9_13

URL : https://hal.archives-ouvertes.fr/inria-00181775

M. Kaufmann and R. Wiese, Embedding Vertices at Points: Few Bends Suffice for Planar Graphs, Journal of Graph Algorithms and Applications, vol.6, issue.1, pp.115-129, 2002.
DOI : 10.7155/jgaa.00046

D. E. Knuth and A. Raghunathan, The Problem of Compatible Representatives, SIAM Journal on Discrete Mathematics, vol.5, issue.3, pp.422-427, 1992.
DOI : 10.1137/0405033

D. Lichtenstein, Planar Formulae and Their Uses, SIAM Journal on Computing, vol.11, issue.2, pp.329-343, 1982.
DOI : 10.1137/0211025

K. Misue, P. Eades, W. Lai, and K. Sugiyama, Layout Adjustment and the Mental Map, Journal of Visual Languages & Computing, vol.6, issue.2, pp.183-210, 1995.
DOI : 10.1006/jvlc.1995.1010

J. Pach and G. Tardos, Untangling a Polygon, Discrete & Computational Geometry, vol.28, issue.4, pp.585-592, 2002.
DOI : 10.1007/s00454-002-2889-y

S. K. Stein, Convex maps, Proceedings of the American Mathematical Society, vol.2, issue.3, pp.464-466, 1951.
DOI : 10.1090/S0002-9939-1951-0041425-5

O. Verbitsky, On the obfuscation complexity of planar graphs, Theoretical Computer Science, vol.396, issue.1-3, 2007.
DOI : 10.1016/j.tcs.2008.02.032

K. Wagner, Bemerkungen zum Vierfarbenproblem, Jahresbericht Deutsch. Math.- Verein, vol.46, pp.26-32, 1936.