M. Alam, T. Biedl, S. Felsner, M. Kaufmann, and S. Kobourov, Proportional contact representations of planar graphs, Journal of Graph Algorithms and Applications, vol.16, issue.3, pp.701-728, 2012.

M. Alam, T. Biedl, S. Felsner, M. Kaufmann, S. Kobourov et al., Computing cartograms with optimal complexity. Discrete & Computational Geometry, vol.50, pp.784-810, 2013.

E. Andreev, On convex polyhedra in lobachevsky spaces, Mat. Sbornik, vol.81, pp.445-478, 1970.

M. Badent, C. Binucci, E. D. Giacomo, W. Didimo, S. Felsner et al., Homothetic triangle contact representations of planar graphs, Proc. of CCCG, pp.233-236, 2007.

H. De-fraysseix, P. O. De-mendez, and P. Rosenstiehl, On triangle contact graphs, Combinatorics, Probability and Computing, vol.3, pp.233-246, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00005621

Y. C. De-verdière, Un principe variationnel pour les empilements de cercles, Inventiones Mathematicae, vol.104, issue.1, pp.655-669, 1991.

C. Duncan, E. Gansner, Y. Hu, M. Kaufmann, and S. Kobourov, Optimal polygonal representation of planar graphs, Algorithmica, vol.63, issue.3, pp.672-691, 2012.

S. Felsner, Triangle contact representations. Prague Midsummer Combinatorial Workshop XV, 2009.

S. Felsner, Rectangle and square representations of planar graphs, Thirty Essays in Geometric Graph Theory, pp.213-248

. Springer, , 2013.

S. Felsner and M. Francis, Contact representations of planar graphs with cubes, Proc. of SoCG '11, pp.315-320, 2011.

S. Felsner, H. Schrezenmaier, and R. Steiner, Pentagon contact representations, Electr. J. Comb, vol.25, issue.3, 2018.

E. Gansner, Y. Hu, and S. Kobourov, On touching triangle graphs, Proc. of Graph Drawing '10, vol.6502, pp.250-261, 2011.

D. Gonçalves and L. Isenmann, Dushnik-Miller dimension of TD-Delaunay complexes, Eur. J. of Combinatorics, 2019.

D. Gonçalves, L. Isenmann, and C. Pennarun, Planar graphs as Lintersection or L-contact graphs, Proc. of 29th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.172-184, 2018.

D. Gonçalves, B. Levêque, and A. Pinlou, Triangle contact representations and duality, Proc. of Graph Drawing '10, vol.6502, pp.262-273, 2011.

M. Kaufmann, J. Kratochvíl, K. A. Lehmann, and A. R. Subramanian, Max-tolerance graphs as intersection graphs: Cliques, cycles and recognition, Proc. of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.832-841, 2006.

P. Koebe, Kontaktprobleme der konformen abbildung, Math.-Phys. Klasse, vol.88, pp.141-164, 1936.

L. Lovász, Geometric representations of graphs, 2009.

T. Müller, E. Van-leeuwen, and J. Van-leeuwen, Integer representations of convex polygon intersection graphs, SIAM J. Discrete Math, vol.27, issue.1, pp.205-231, 2013.

M. Nöllenburg, R. Prutkin, and I. Rutter, Edge-weighted contact representations of planar graphs, Journal of Graph Algorithms and Applications, vol.17, issue.4, pp.441-473, 2013.

W. Schnyder, Planar graphs and poset dimension, Order, vol.5, pp.323-343, 1989.

O. Schramm, Combinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps, 1990.

O. Schramm, Square tilings with prescribed combinatorics, Isr. J. Math, vol.84, pp.97-118, 1993.

H. Schrezenmaier, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol.10520, pp.425-437, 2017.

C. Thomassen, Plane representations of graphs, Progress in graph theory (Bondy and Murty, pp.336-342, 1984.