B. Albar and D. Gonçalves, On triangles in K r -minor free graphs, Journal of Graph Theory, vol.88, issue.1, pp.154-173, 2018.

M. Axenovich, D. Gonçalves, J. Rollin, and T. Ueckerdt, The k-strong induced arboricity of a graph, Eur. J. of Combin, vol.67, pp.1-20, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01888032

N. Cohen, D. Gonçalves, E. J. Kim, C. Paul, I. Sau et al., A polynomial-time algorithm for Outerplanar Diameter Improvement, J. of Comput. and Syst. Sci, vol.89, pp.315-327, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01178222

V. Despré, D. Gonçalves, and B. Lévêque, Encoding Toroidal Triangulations. Disc. & Comput. Geom, vol.57, issue.3, pp.507-544, 2017.

L. Esperet, D. Gonçalves, and A. Labourel, Coloring Non-Crossing Strings, Elec. J. of Combin, vol.23, issue.4, p.18, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01480244

B. Albar, D. Gonçalves, and K. Knauer, Orienting triangulations, Journal of Graph Theory, vol.83, issue.4, pp.392-405, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01457782

B. Albar, D. Gonçalves, and J. L. Ramírez-alfonsín, Detecting minors in matroids through triangles, European Journal of Combinatorics, vol.53, pp.50-58, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01263827

M. C. Francis, D. Gonçalves, and P. Ochem, The Maximum Clique Problem in Multiple Interval Graphs, Algorithmica, vol.71, issue.4, pp.812-836, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01263898

S. Bessy, D. Gonçalves, and J. Sereni, Two floor building needing eight colors, Journal of Graph Algorithms and Applications, vol.19, issue.1, pp.1-9, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00996709

D. Gonçalves and B. Lévêque, Toroidal Maps : Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations, Discrete and Computational Geometry, vol.51, issue.1, pp.67-131, 2014.

N. Bousquet, D. Gonçalves, G. B. Mertzios, C. Paul, I. Sau et al., Parameterized Domination in Circle Graphs, Theory of Comp. Syst, vol.54, issue.1, pp.45-72, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01178188

D. Gonçalves, A. Parreau, and A. Pinlou, Locally identifying coloring in bounded expansion classes of graphs, Discrete Applied Mathematics, vol.161, issue.18, pp.2946-2951, 2013.

D. Gonçalves and E. J. Kim, On Exact Algorithms for Permutation CSP, Theo. Comp. Sci, vol.511, pp.109-116, 2013.

J. Bang-jensen, D. Gonçalves, and A. Yeo, Partitioning the arcs of a digraph into a star forests of the underlying graph with prescribed orientation properties Theo, Comp. Sci, vol.475, pp.13-20, 2013.

D. Gonçalves, B. Leveque, and A. Pinlou, Triangle Contact Representations and Duality. Discrete and Computational Geometry, vol.48, pp.239-254, 2012.

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé, On spanning galaxies in digraphs, Discrete Applied Mathematics, vol.160, issue.6, pp.744-754, 2012.

D. Gonçalves, A. Pinlou, M. Rao, and S. Thomassé, The Domination Number of Grids, SIAM J. Discrete Math, vol.25, issue.3, pp.1443-1453, 2011.

D. Gonçalves, On Vertex Partitions and some Minor-Monotone Parameters, Journal of Graph Theory, vol.66, issue.1, pp.49-56, 2011.

J. Chalopin, D. Gonçalves, and P. Ochem, Planar graphs are in 1-STRING, Discrete and Computational Geometry, vol.43, issue.3, pp.626-647, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00308130

J. Daligault, M. Rao, and D. Gonçalves, Diamond-free Circle Graphs are Helly Circle, Discrete Math, vol.310, issue.4, pp.845-849, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00432897

D. Gonçalves, A Planar linear hypergraph whose edges cannot be represented as straight line segments, Eur. J. Combin, vol.30, pp.280-282, 2009.

D. Gonçalves, Covering planar graphs with forests, one having bounded maximum degree, J. Combin. Theory Ser. B, vol.99, pp.314-322, 2009.

D. Gonçalves and P. Ochem, On star and caterpillar arboricity, Discrete Math, vol.309, pp.3694-3702, 2009.

D. Gonçalves, On the L(p,1)-labelling of graphs, Discrete Math, vol.308, issue.8, pp.1405-1414, 2008.

J. Bang-jensen, D. Gonçalves, and I. L. Gørtz, Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs, Discrete Optimization, vol.4, issue.3-4, pp.334-348, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00250124

D. Gonçalves, Caterpillar arboricity of planar graphs, Discrete Math, vol.307, issue.16, pp.2112-2121, 2007.

D. Gonçalves, A. Raspaud, and M. A. Shalu, On Oriented Labelling Parameters. Formal Models, Languages and Applications, Series in Machine Perception and artificial Intelligence, vol.66, pp.34-45, 2006.

D. Gonçalves, L. Isenmann, and C. Pennarun, Planar Graphs as L-intersection or L-contact graphs, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2018.

M. Francis and D. Gonçalves, Dushnik-Miller dimension of contact systems of d-dimensional boxes, 9th European Conference on Combinatorics, Graph Theory, and Applications, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01693192

D. Gonçalves and L. Isenmann, Dushnik-Miller dimension of TD-Delaunay complexes, 33rd European Workshop on Computational Geometry, 2017.

S. Bessy, M. Bougeret, D. Gonçalves, and C. Paul, Maximum Independent Set in EPG Graphs. 13th Workshop on Approximation and Online Algorithms (WAOA 2015), vol.9499, pp.158-169

N. Cohen, D. Gonçalves, E. J. Kim, C. Paul, I. Sau et al., A Polynomial-time Algorithm for Outerplanar Diameter Improvement, 10th International Computer Science Symposium in Russia (CSR 2015), vol.9139, pp.123-142
URL : https://hal.archives-ouvertes.fr/hal-01178222

B. Albar, D. Gonçalves, and K. Knauer, Orienting triangulations. 31st European Workshop on Computational Geometry, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01457782

D. Gonçalves, M. Montassier, and A. Pinlou, Entropy compression method applied to graph colorings, 9th International Colloquium on Graph Theory and combinatorics

B. Albar, D. Gonçalves, and J. Ramírez-alfonsín, Detecting minors in matroids through triangles, 9th International Colloquium on Graph Theory and combinatorics
URL : https://hal.archives-ouvertes.fr/lirmm-01263827

B. Albar and D. Gonçalves, Too Many Triangles. VII Latin-American Algorithms, Graphs and Optimization Symposium, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-01263909

M. C. Francis, D. Gonçalves, and P. Ochem, The Maximum Clique Problem in Multiple Interval Graphs, 38th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2012), vol.7551, pp.57-68, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-01263898

N. Bousquet, D. Gonçalves, G. Mertzios, C. Paul, I. Sau et al., Domination in Circle Graphs, 38st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2012), vol.7551, pp.308-319, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01178188

D. Gonçalves and E. J. Kim, On Exact Algorithms for Permutation CSP. International Workshop on Approximation

D. Gonçalves, B. Levêque, and A. Pinlou, Triangle contact representations and duality, 18th International Symposium on Graph Drawing (GD 2010), vol.6502, pp.262-273, 2011.

J. Chalopin and D. Gonçalves, Every planar graph is the intersection graph of segments in the plane, 41st Annual ACM Symposium on Theory of Computing, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00395364

D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé, Spanning galaxies in digraphs. 5th European Conference on Combinatorics, Graph Theory, and Applications, 2009.

L. Esperet, D. Gonçalves, and A. Labourel, Coloring a set of touching strings, 5th European Conference on Combinatorics, Graph Theory, and Applications, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00433096

D. Gonçalves, Covering planar graphs with forests, one having a bounded maximum degree, p.1

&. Topological and . Geometric, Graph Theory International Conference, 2008.

J. Chalopin, D. Gonçalves, and P. Ochem, Planar graphs are in 1-STRING. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00308130

D. Gonçalves, On Vertex Partitions and the Colin deVerdì ere Parameter. 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, 2006.

J. Chalopin, D. Gonçalves, and P. Ochem, On graph classes defined by overlap and intersection models, 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, 2006.

D. Gonçalves and P. Ochem, On some Arboricities in Planar Graphs, 7th International Colloquium on Graph Theory, 2005.

D. Gonçalves, On the L(p,1)-labelling of graphs, 3rd European Conference on Combinatorics, Graph Theory, and Applications, 2005.

D. Gonçalves, Edge Partition of Planar Graphs into Two Outerplanar Graphs, 37th Annual ACM Symposium on Theory of Computing (STOC, 2005.

D. Gonçalves and M. Montassier, Acyclic choosability of graphs with small maximum degree, 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), vol.3787, pp.239-248

D. Gonçalves, Caterpillar arboricity of planar graphs, Graph Theory and Applications, 2003.

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

S. Bessy, M. Bougeret, D. Gonçalves, and C. Paul, On independent set on B 1 -EPG graphs
URL : https://hal.archives-ouvertes.fr/lirmm-01264022

D. Gonçalves, K. Knauer, and B. Lévêque, Structure of Schnyder labelings on orientable surfaces

D. Gonçalves, M. Montassier, and A. Pinlou, Entropy compression method applied to graph colorings

N. Aerts and S. Felsner, Straight-Line Triangle Representations via Schnyder Labelings, Journal of Graph Algorithms and Applications, vol.19, issue.1, pp.467-505, 2015.

N. Aerts and S. Felsner, Vertex Contact Representations of Paths on a Grid, Journal of Graph Algorithms and Applications, vol.19, issue.3, pp.817-849, 2015.

A. R. Ahmed, F. De-luca, S. Devkota, A. Efrat, M. I. Hossain et al., ArXiv, 1544.

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

M. Albenque and D. Poulalhon, Generic method for bijections between blossoming trees and planar maps, Electronic Journal of Combinatorics, vol.22, issue.2, p.38, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01185339

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

A. Asinowski, E. Cohen, M. C. Golumbic, V. Limouzy, M. Lipshteyn et al., Vertex Intersection Graphs of Paths on a Grid, J. Graph Algorithms Appl, vol.16, issue.2, pp.129-150, 2012.

M. Badent, C. Binucci, E. D. Giacomo, W. Didimo, S. Felsner et al., Homothetic triangle contact representations of planar graphs, Proceedings of the 19th Canadian Conference on Computational Geometry CCCG '07, pp.233-236, 2007.

J. Barát and C. Thomassen, Claw-decompositions and Tutte-orientations, Journal of Graph Theory, vol.52, pp.135-146, 2006.

J. Barbay, L. Castelli-aleardi, M. He, and J. I. Munro, Succinct representation of labeled graphs, Algorithmica, vol.61, pp.224-257, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00713051

O. Bernardi and G. Chapuy, A bijection for covered maps, or a shortcut between Harer-Zagier's and Jackson's formulas, Journal of Combinatorial Theory A, vol.118, pp.1718-1748, 2011.

T. Biedl and M. Derka, 1-String B 1 -VPG Representations of Planar Partial 3-Trees and Some Subclasses, ArXiv, 2015.

T. Biedl and M. Derka, 1-String B 2 -VPG representation of planar graphs, Journal of Computational Geometry, vol.7, issue.2, 2016.

T. Biedl and M. Derka, The (3,1)-ordering for 4-connected planar triangulations, Journal of Graph Algorithms and Applications, vol.20, issue.2, pp.347-362, 2016.

T. Biedl and M. Derka, Order-Preserving 1-String Representations of Planar Graphs, Proc. of SOFSEM 2017, pp.283-294, 2017.

A. Bondy and M. R. Murty, Graph Theory, Graduate Texts in Mathematics, 2008.

D. Bayer, I. Peeva, and B. Sturmfels, Monomial Resolutions. Math. Research Letters, vol.5, issue.1, pp.31-46, 1998.

N. Bonichon, C. Gavoille, N. Hanusse, and D. Ilcinkas, Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces, Proc. of WG '10, vol.6410, pp.266-278, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00454565

N. Bonichon, A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths, Discrete Mathematics, vol.298, pp.104-114, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00307596

G. Brightwell and W. T. Trotter, The order dimension of convex polytopes, SIAM Journal on Discrete Mathematics, vol.6, issue.2, pp.230-245, 1993.

L. Castelli-aleardi, E. Fusy, and T. Lewiner, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Discrete and Computational Geometry, vol.42, pp.489-516, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00712046

L. Castelli-aleardi, O. Devillers, and E. Fusy, Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings, International Symposium on Graph Drawing GD 2012, pp.376-387, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00793636

N. Castro, F. Cobos, J. C. Dana, A. Márquez, and M. Noy, Triangle-free planar graphs as segment intersection graphs, J. Graph Algorithms Appl, vol.6, issue.1, pp.7-26, 2002.

D. Catanzaro, S. Chaplick, S. Felsner, B. V. Halldórsson, M. M. Halldórsson et al., Max point-tolerance graphs, vol.216, pp.84-97, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01943982

E. Chambers, D. Eppstein, M. Goodrich, and M. Löffler, Drawing graphs in the plane with a prescribed outer face and polynomial area, LNCS, vol.6502, pp.129-140, 2011.

S. Chaplick, V. Jeí-inek, J. Kratochvíl, and T. Vysko?il, Bend-bounded path intersection graphs : Sausages, noodles, and waffles on a grill, Proc. of Graph-Theoretic Concepts in Computer Science, pp.274-285, 2012.

S. Chaplick, S. G. Kobourov, and T. Ueckerdt, Equilateral L-contact graphs, Proc. of the International Workshop on Graph-Theoretic Concepts in Computer Science, pp.139-151, 2013.

S. Chaplick and T. Ueckerdt, Planar Graphs as VPG-Graphs, J. Graph Algorithms Appl, vol.17, issue.4, pp.475-494, 2013.

G. Chapuy, A new combinatorial identity for unicellular maps, via a direct bijective approach, Advances in Applied Mathematics, vol.47, pp.874-893, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01185440

X. Chen, J. Pach, M. Szegedy, and G. Tardos, Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles, Random Structures and Algorithms, vol.34, issue.1, pp.11-23, 2009.

P. Chew and R. L. Drysdale, Voronoi diagrams based on convex distance functions, Proc. 1st Ann. Symp. on Computational Geometry, pp.235-244, 1985.

E. Cohen, M. C. Golumbic, W. T. Trotter, R. Wang, P. et al., Order, vol.33, issue.1, pp.39-49, 2016.

Y. Colin, Un principe variationnel pour les empilements de cercles, Inventiones Mathematicae, vol.104, pp.655-669, 1991.

J. Czyzowicz, E. Kranakis, and J. Urrutia, A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments, Inform. Process. Lett, vol.66, issue.3, pp.125-126, 1998.

G. D. Battista, R. Tamassia, and L. Vismara, Output-sensitive reporting of disjoint paths, Algorithmica, vol.23, pp.302-340, 1999.

C. Duncan, M. Goodrich, and S. Kobourov, Planar drawings of h igher-genus graphs, Journal of Graph Algorithms and Applications, vol.15, pp.13-32, 2011.

B. Dushnik and E. W. Miller, Partially ordered sets, American Journal of Mathematics, vol.63, issue.3, pp.600-610, 1941.

G. Ehrlich, S. Even, and R. E. Tarjan, Intersection Graphs of Curves in the Plane, J. Combin. Theory. Ser. B, vol.21, pp.8-20, 1976.

W. Evans, S. Felsner, G. Kobourov, and T. Ueckerdt, Graphs admitting d-realizers : spanning-treedecompositions and box-representations Proc. of EuroCG '14, 2014.

M. C. Francis and A. Lahiri, VPG and EPG bend-numbers of Halin graphs, Discrete Applied Mathematics, vol.215, pp.95-105, 2016.

H. De-fraysseix, P. Ossona-de-mendez, and J. Pach, Representation of planar graphs by segments. Intuitive geometry (Szeged, 1991), Colloq. Math. Soc. János Bolyai, vol.63, pp.109-117, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00005620

H. De-fraysseix and P. Ossona-de-mendez, Intersection Graphs of Jordan Arcs, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.49, pp.11-28, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00005625

H. De-fraysseix and P. Ossona-de-mendez, Representations by contact and intersection of segments, Algorithmica, vol.47, issue.4, pp.453-463, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00138575

S. Felsner, Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes, Order, vol.18, pp.19-37, 2001.

S. Felsner, Geodesic Embeddings and Planar Graphs, Order, vol.20, pp.135-150, 2003.
DOI : 10.1023/b:orde.0000009251.68514.8b

S. Felsner, Lattice structures from planar graphs, Electron. J. Combin, vol.11, p.15, 2004.

S. Felsner, Geometric graphs and arrangements : some chapters from combinatorial geometry, Advanced Lectures in Mathematics, 2004.

S. Felsner and W. T. Trotter, Posets and planar graphs, J. Graph Theory, vol.49, pp.262-272, 2005.
DOI : 10.1002/jgt.20081
URL : http://www.math.tu-berlin.de/%7Efelsner/Paper/ppg-rev.pdf

S. Felsner, Empty Rectangles and Graph Dimension, 2006.

S. Felsner and F. Zickfeld, Schnyder Woods and Orthogonal Surfaces, vol.40, pp.103-126, 2008.
DOI : 10.1007/s00454-007-9027-9
URL : https://link.springer.com/content/pdf/10.1007%2Fs00454-007-9027-9.pdf

S. Felsner, Prague Midsummer Combinatorial Workshop XV, 2009.

S. Felsner, K. Knauer, and ?. Uld-lattices, Combin. Proba. Comput, vol.18, issue.5, pp.707-724, 2009.

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

S. Felsner, Rectangle and Square Representations of Planar Graphs, Thirty Essays in Geometric Graph Theory, pp.213-248, 2012.

S. Felsner, K. Knauer, G. B. Mertzios, and T. Ueckerdt, Intersection graphs of L-shapes and segments in the plane, Discrete Applied Mathematics, vol.206, pp.48-55, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01414991

S. Felsner, H. Schrezenmaier, and R. Steiner, Pentagon contact representations, ENDM proc, 2017.
DOI : 10.1016/j.endm.2017.06.069
URL : http://www.math.tu-berlin.de/~felsner/Paper/fcf-long.pdf

H. De-fraysseix, P. Ossona-de-mendez, and P. , Combinatorics, Probability and Computing, vol.3, pp.233-246, 1994.

H. De-fraysseix and P. Ossona-de-mendez, On topological aspects of orientations, vol.229, pp.57-72, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00005628

H. De-fraysseix and P. O. De-mendez, Barycentric systems and stretchability, vol.155, pp.1079-1095, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00147454

H. De-fraysseix, J. Pach, and R. Pollack, Small sets supporting fary embeddings of planar graphs, Proc. of the twentieth annual ACM symposium on Theory of computing, STOC '88, pp.426-433, 1988.

´. E. Fusy, Transversal structures on triangulations : A combinatorial study and straight-line drawings, Disc. Math, vol.309, issue.7, pp.1870-1894, 2009.

´. E. Fusy, New bijective links on planar maps via orientations, Eur. J. of Combin, vol.31, issue.1, pp.145-160, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00330577

E. R. Gansner, Y. Hu, M. Kaufmann, and S. G. Kobourov, Optimal Polygonal Representation of Planar Graphs, Algorithmica, vol.63, issue.3, pp.672-691, 2012.

E. R. Gansner, Y. Hu, and S. G. Kobourov, On Touching Triangle Graphs, Proc. Graph Drawing '10 LNCS, vol.6502, pp.250-261, 2010.

P. Giblin, Graphs, surfaces and homology, 2010.

I. B. Hartman, I. Newman, and R. Ziv, On grid intersection graphs, Discrete Math, vol.87, issue.1, pp.41-52, 1991.

S. Ho¸stenho¸sten and W. D. Morris, The order dimension of the complete graph, Discrete mathematics, vol.201, issue.1-3, pp.133-139, 1999.

B. Kappelle, Kontact-und Schnittdarstellungen planarer Graphen, 2015.

M. Kaufmann, J. Kratochvíl, K. A. Lehmann, and A. R. Subramanian, Max-tolerance graphs as intersection graphs : Cliques, cycles and recognition, Proc. SODA '06, pp.832-841, 2006.

S. Kobourov, T. Ueckerdt, and K. Verbeek, Combinatorial and geometric properties of planar Laman graphs, Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pp.1668-1678, 2013.

P. Koebe, Kontaktprobleme der konformen Abbildung, vol.88, pp.141-164, 1936.

J. , Geometric representations of Graphs, Graduate Course, 2005.

J. , Bertinoro Workshop on Graph Drawing, 2007.

L. Lovász, Geometric Representations of Graphs, 2009.

A. Mary, Dimension de poset et subdivisions simpliciales, 2010.

W. S. Massey, Algebraic Topology : An Introduction, Harcourt, Brace and World, 1967.

S. Mehrabi, Approximation Algorithms for Independence and Domination on B 1 -VPG and B 1 -EPG Graphs, ArXiv, 2017.

M. Middendorf and F. Pfeiffer, The max clique problem in classes of string-graphs, Discrete mathematics, vol.108, pp.365-372, 1992.

E. Miller, Planar graphs as minimal resolutions of trivariate monomial ideals, Documenta Mathematica, vol.7, pp.43-90, 2002.

B. Mohar, Straight-line representations of maps on the torus and other flat surfaces, vol.155, pp.173-181, 1996.

B. Mohar and P. Rosenstiehl, Tessellation and visibility representations of maps on the torus, vol.19, pp.249-263, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00261329

B. Mohar and C. Thomassen, Graphs on surfaces, Johns Hopkins Studies in the Mathematical Sciences, 2001.

T. Müller, E. J. 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.

P. Ossona-de-mendez, Geometric Realization of Simplicial Complexes, Proc. of Int. Symp. on Graph Drawing, vol.1731, pp.323-332, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00005637

D. Poulalhon and G. Schaeffer, Optimal coding and sampling of triangulations, Algorithmica, vol.46, pp.505-527, 2006.
DOI : 10.1007/s00453-006-0114-8
URL : https://hal.archives-ouvertes.fr/hal-00159287

J. Propp, Lattice structure for orientations of graphs, 1993.

E. R. Scheinerman, Intersection classes and multiple intersection parameters of graphs, 1984.

W. Schnyder, Planar graphs and poset dimension, Order, vol.5, pp.323-343, 1989.
DOI : 10.1007/bf00353652

W. Schnyder, Embedding planar graphs on the grid, Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '90, pp.138-148, 1990.

O. Schramm, Combinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps, Modified version of PhD thesis from, 1990.

O. Schramm, Square tilings with prescribed combinatorics, Isr. J. Math, vol.84, pp.97-118, 1993.
DOI : 10.1007/bf02761693

H. Schrezenmaier, Homothetic triangle contact representations, Proc. of WG '17, vol.10520, pp.425-437, 2017.
DOI : 10.1007/978-3-319-68705-6_32

R. Skrekovski, List Improper Colourings of Planar Graphs, Combinatorics, Probability and Computing, vol.8, issue.3, pp.293-299, 1999.

Y. Sun and M. Sarrafzadeh, Floorplanning by Graph Dualization : L-shaped Modules, Algorithmica, vol.10, pp.429-456, 1993.
DOI : 10.1109/iscas.1990.112603

W. T. Trotter, Combinatorics and partially ordered sets : Dimension theory, Johns Hopkins Series in the Mathematical Sciences, 1992.

M. Van-kreveld and B. Speckmann, On rectangular cartograms, Computational Geometry, vol.37, issue.3, pp.175-187, 2007.

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

D. West, Open problems, SIAM J. Discrete Math. Newslett, vol.2, issue.1, pp.10-12, 1991.

H. Whitney, References 1. Bonichon, N.: A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths, Discrete Math, vol.32, issue.2, pp.104-114, 1931.

N. Bonichon, C. Gavoille, N. Hanusse, and D. Ilcinkas, Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces, Proceeding WG'10 Proceedings of the 36th International Conference on Graph-Theoretic Concepts in Computer Science, pp.266-278, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00454565

L. Castelli-aleardi, E. Fusy, and T. Lewiner, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Discrete Comput. Geom, vol.42, pp.489-516, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00712046

L. Castelli-aleardi and E. Fusy, Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings, Proceeding GD'12 Proceedings of the 20th International Conference on Graph Drawing, pp.376-387, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00705181

E. Chambers, D. Eppstein, M. Goodrich, and M. Löffler, Drawing graphs in the plane with a prescribed outer face and polynomial area, Lect. Notes Comput. Sci, vol.6502, pp.129-140, 2011.

C. Duncan, M. Goodrich, and S. Kobourov, Planar drawings of higher-genus graphs, J. Graph Algorithms Appl, vol.15, pp.13-32, 2011.

S. Felsner, Convex drawings of planar graphs and the order dimension of 3-polytopes, Order, vol.18, pp.19-37, 2001.

S. Felsner, Geodesic embeddings and planar graphs, Order, vol.20, pp.135-150, 2003.

S. Felsner, Lattice structures from planar graphs, Electron. J. Comb, vol.11, issue.1, p.15, 2004.

S. Felsner and W. T. Trotter, Posets and planar graphs, J. Graph Theory, vol.49, pp.273-284, 2005.

S. Felsner and F. Zickfeld, Schnyder woods and orthogonal surfaces, Discrete Comput. Geom, vol.40, pp.103-126, 2008.

S. Felsner, Geometric Graphs and Arrangements, 2004.

G. Fijavz, , 2011.

H. De-fraysseix, P. Ossona-de-mendez, and P. Rosenstiehl, On triangle contact graphs, Comb. Probab. Comput, vol.3, pp.233-246, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00261319

H. De-fraysseix and P. Ossona-de-mendez, On topological aspects of orientations, Discrete Math, vol.229, pp.57-72, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00005628

D. Gonçalves, B. Lévêque, and A. Pinlou, Triangle contact representations and duality. Discrete Comput, Geom, vol.48, pp.239-254, 2012.

D. Gonçalves, B. Lévêque, and A. Pinlou, Triangle contact representations and duality (GD'10), vol.6502, pp.262-273, 2011.

G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, vol.16, pp.4-32, 1996.

J. Kratochvíl, In: Bertinoro Workshop on Graph Drawing, 2007.

E. Miller, Planar graphs as minimal resolutions of trivariate monomial ideals, Doc. Math, vol.7, pp.43-90, 2002.

B. Mohar, Straight-line representations of maps on the torus and other flat surfaces, Discrete Math, vol.155, pp.173-181, 1996.

P. Rosenstiehl, Embedding in the plane with orientation constraints: The angle graph, Annals New York Academy of Sciences, 1989.
URL : https://hal.archives-ouvertes.fr/hal-00261218

B. Mohar and P. Rosenstiehl, Tessellation and visibility representations of maps on the torus, Discrete Comput. Geom, vol.19, pp.249-263, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00261329

D. Poulalhon and G. Schaeffer, Optimal coding and sampling of triangulations, Algorithmica, vol.46, pp.505-527, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00159287

N. Robertson and P. D. Seymour, Graph minors. VI. Disjoint paths across a disc, J. Comb. Theory, Ser. B, vol.41, pp.115-138, 1986.

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

, Discrete Comput Geom, vol.57, pp.507-544, 2017.

B. Albar, D. Gonçalves, and K. Knauer, Orienting triangulations, J. Graph Theory, vol.83, issue.4, pp.392-405, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01457782

M. Albenque and D. Poulalhon, Generic method for bijections between blossoming trees and planar maps, Electron. J. Comb, vol.22, issue.2, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01185339

L. C. Aleardi, E. Fusy, and T. Lewiner, Optimal encoding of triangular and quadrangular meshes with fixed topology, Proceedings of the 22nd Canadian Conference on Computational Geometry, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00709972

O. Bernardi, Bijective counting of tree-rooted maps and shuffles of parenthesis systems, Electron. J. Comb, vol.14, p.9, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00018111

O. Bernardi and G. Chapuy, A bijection for covered maps, or a shortcut between Harer-Zagier's and Jackson's formulas, J Comb Theory A, vol.118, pp.1718-1748, 2011.

N. Bonichon, C. Gavoille, and N. Hanusse, An information-theoretic upper bound of planar graphs using triangulation, Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), vol.2607, pp.499-510, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00307599

G. Chapuy, A new combinatorial identity for unicellular maps, via a direct bijective approach, Adv. Appl. Math, vol.47, pp.874-893, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01185440

G. Chapuy, M. Marcus, and G. Schaeffer, A bijection for rooted maps on orientable surfaces, SIAM J. Discrete Math, vol.23, pp.1587-1611, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00713482

H. De-fraysseix and O. P. De-mendez, On topological aspects of orientations, Discrete Math, vol.229, pp.57-72, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00005628

P. O. De-mendez, Orientations bipolaires, 1994.

E. Duchi, D. Poulalhon, and G. Schaeffer, Uniform random sampling of simple branched coverings of the sphere by itself, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.294-304, 2013.

S. Felsner, Lattice structures from planar graphs, Electron. J. Comb, vol.11, p.15, 2004.

E. Fusy, Combinatoire des cartes planaires et applications algorithmiques, 2007.

P. Giblin, Graphs. Surfaces and Homology, 2010.

D. Gonçalves and B. Lévêque, Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations, Discrete Comput. Geom, vol.51, pp.67-131, 2014.

D. Gonçalves, K. Knauer, and B. Lévêque, Structure of Schnyder labelings on orientable surfaces, 2015.

G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, vol.16, pp.4-32, 1996.

B. Lévêque, Generalization of Schnyder woods to orientable surfaces and applications, 2016.

B. Mohar, Straight-line representations of maps on the torus and other flat surfaces, Discrete Math, vol.155, pp.173-181, 1996.

D. Poulalhon and G. Schaeffer, Optimal coding and sampling of triangulations, Algorithmica, vol.46, pp.505-527, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00159287

J. Propp, Lattice structure for orientations of graphs, 1993.

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

T. Ueckerdt, Geometric representations of graphs with low polygonal complexity, 2011.

B. Albar, D. Gonçalves, and K. Knauer, Orienting triangulations, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01457782

J. Barát and C. Thomassen, Claw-decompositions and Tutte-orientations, Journal of Graph Theory, vol.52, pp.135-146, 2006.

J. Barbay, L. Castelli-aleardi, M. He, and J. I. Munro, Succinct representation of labeled graphs, Algorithmica, vol.61, pp.224-257, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00713051

N. Bonichon, C. Gavoille, N. Hanusse, and D. Ilcinkas, Connections between ThetaGraphs, Delaunay Triangulations, and Orthogonal Surfaces. WG10, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00454565

V. Despré, D. Gonçalves, and B. Lévêque, Encoding toroidal triangulations, 2015.

S. Felsner, Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes, Order, vol.18, pp.19-37, 2001.

S. Felsner, Geodesic Embeddings and Planar Graphs, Order, vol.20, pp.135-150, 2003.

S. Felsner, Lattice structures from planar graphs, Electron. J. Combin, vol.11, 2004.

S. Felsner, K. Knauer, and ?. Uld-lattices, Comb. Probab. Comput, vol.18, issue.5, pp.707-724, 2009.

S. Felsner, Geometric Graphs and Arrangements, 2004.

H. De-fraysseix, P. Ossona-de-mendez, and P. , Combinatorics, Probability and Computing, vol.3, pp.233-246, 1994.

H. De-fraysseix and P. Ossona-de-mendez, On topological aspects of orientations, vol.229, pp.57-72, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00005628

P. Giblin, Graphs, surfaces and homology, 2010.

D. Gonçalves, B. Lévêque, and A. Pinlou, Triangle contact representations and duality, vol.48, pp.239-254, 2012.

D. Gonçalves and B. Lévêque, Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations, Discrete and Computational Geometry, vol.51, pp.67-131, 2014.

G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, vol.16, pp.4-32, 1996.

W. S. Massey, Algebraic Topology: An Introduction, Harcourt, Brace and World, 1967.

E. Miller, Planar graphs as minimal resolutions of trivariate monomial ideals, Documenta Mathematica, vol.7, pp.43-90, 2002.

B. Mohar and P. , Tessellation and visibility representations of maps on the torus, Discrete Comput. Geom, vol.19, pp.249-263, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00261329

P. Ossona-de-mendez, Orientations bipolaires, 1994.

D. Poulalhon and G. Schaeffer, Optimal coding and sampling of triangulations, Algorithmica, vol.46, pp.505-527, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00159287

J. Propp, Lattice structure for orientations of graphs, 1993.

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

W. Schnyder, Embedding planar graphs on the grid, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '90, p.138, 1990.

J. Barát and C. Thomassen, Claw-decompositions and Tutte-orientations, J Graph Theory, vol.52, pp.135-146, 2006.

O. Bernardi, Bijective counting of tree-rooted maps and shuffles of parenthesis systems, Electron J Combin, vol.14, p.36, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00018111

O. Bernardi and N. Bonichon, Intervals in Catalan lattices and realizers of triangulations, J Combin Theory Ser A, vol.116, pp.55-75, 2009.

L. Castelli-aleardi, E. Fusy, and T. Lewiner, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Disc Comput Geometry, vol.42, pp.489-516, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00712046

H. De-fraysseix, P. O. De-mendez, and P. Rosenstiehl, On triangle contact graphs, Combin Probab Comput, vol.3, pp.233-246, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00008999

S. Felsner, Convex drawings of planar graphs and the order dimension of 3-polytopes, Order, vol.18, pp.19-37, 2001.

S. Felsner, Lattice structures from planar graphs, Electron J Combin, vol.11, p.24, 2004.

D. Gonçalves, K. Knauer, and B. Lévêque, Structure of Schnyder labelings on orientable surfaces, 2015.

D. Gonçalves and B. Lévêque, Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations, Disc Comput Geometry, vol.51, pp.67-131, 2014.

B. Mohar and C. Thomassen, Graphs on surfaces, Johns Hopkins Studies in the Mathematical Sciences, 2001.

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

W. Schnyder, Embedding planar graphs on the grid, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 90, pp.138-148, 1990.

, By definition of the arcs, either e * is uni-directed z), so r 1 (e * ) = max{r 1 (u), r 1 (v)} ? r 1 (z) ? r 1, vol.48, pp.239-254, 2012.

, If uv is uni-directed in color 1 from u to v, then Lemma 6 implies that R 2 (u) R 2 (w)

, One-to-One Correspondence

D. Fraysseix,

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

N. Bonichon, S. Felsner, and M. Mosbah, Convex drawings of 3-connected plane graphs, Algorithmica, vol.47, pp.399-420, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00306291

H. De-fraysseix, P. Ossona-de-mendez, and P. Rosenstiehl, On triangle contact graphs, Comb. Probab. Comput, vol.3, pp.233-246, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00008999

H. De-fraysseix and P. Ossona-de-mendez, On topological aspects of orientations, Discrete Math, vol.229, pp.57-72, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00005628

H. De-fraysseix and P. Ossona-de-mendez, Barycentric systems and stretchability, Discrete Appl. Math, vol.155, pp.1079-1095, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00147454

H. De-fraysseix, J. Pach, and R. Pollack, Small sets supporting Fáry embeddings of planar graphs, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pp.426-433, 1988.

S. Felsner, Convex drawings of planar graphs and the order dimension of 3-polytopes, Order, vol.18, pp.19-37, 2001.

S. Felsner, Geodesic embeddings and planar graphs, Order, vol.20, pp.135-150, 2003.

S. Felsner, Lattice structures from planar graphs, Electron. J. Combin, vol.11, 2004.

S. Felsner, Geometric Graphs and Arrangements, 2004.

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

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

D. Gonçalves, B. Lévêque, and A. Pinlou, Homothetic triangle representations of planar graphs, 2011.

P. Koebe, Kontaktprobleme der konformen Abbildung, Ber. Verh. Sachs. Akad. Wiss. Leipzig, Math.-Phys. Kl, vol.88, pp.141-164, 1936.

E. Miller, Planar graphs as minimal resolutions of trivariate monomial ideals, Doc. Math, vol.7, pp.43-90, 2002.

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

, Discrete Comput Geom, vol.43, pp.626-647, 2010.

, Proceedings of the eighteenth annual ACM-SIAM Symposium on Discrete algorithms, 2007.

J. Chalopin, CMI, 39 rue Joliot-Curie, 13453 Marseille Cedex 13

.. .. Lirmm and ,. , This implies by Lemma 2 that T 2 is a W-triangulation. Suppose that there exists an edge a i a j (resp. b i b j , c i c j ) with 1 < i + 1 < j ? p (resp. 1 < i + 1 < j ? q, 1 < i + 1 < j ? r). Then, the cycle (a, a i , a j ) (resp, Bât 490, 91405 Orsay Cedex, France we have that

, We extend the strings a 2, we obtain (?, R)

, ? ? is a 1-string representation of T : Indeed

N. De-castro, F. Cobos, J. C. Dana, A. Márquez, and M. Noy, Triangle-free planar graphs as segment intersection graphs, J. Graph Algorithms Appl, vol.6, issue.1, pp.7-26, 2002.

J. Chalopin and D. Gonçalves, Every planar graph is the intersection graph of segments in the plane, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00395364

G. Ehrlich, S. Even, and R. E. Tarjan, Intersection graphs of curves in the plane, J. Combin. Theory., Ser. B, vol.21, pp.8-20, 1976.

H. De-fraysseix, P. Ossona-de-mendez, and J. Pach, Representation of planar graphs by segments, Colloq. Math. Soc. János Bolyai, vol.63, pp.109-117, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00005620

H. De-fraysseix and P. Ossona-de-mendez, Intersection graphs of Jordan arcs, DIMACS Ser. Discrete Math. Theor. Comput. Sci, vol.49, pp.11-28, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00005625

H. De-fraysseix and P. Ossona-de-mendez, Representations by contact and intersection of segments, Algorithmica, vol.47, issue.4, pp.453-463, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00138575

D. Gonçalves, Edge-partition of planar graphs into two outerplanar graphs, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp.504-512, 2005.

I. B. Hartman, .. Newman, I. Ziv, and R. , On grid intersection graphs, Discrete Math, vol.87, issue.1, pp.41-52, 1991.

P. Koebe, Kontaktprobleme der Konformen Abbildung, Ber. Sächs. Akad. Wiss. Leipzig, Math.-Phys. Kl, vol.88, pp.141-164, 1936.

E. R. Scheinerman, Intersection classes and multiple intersection parameters of graphs, 1984.

D. West, Open problems, SIAM J. Discrete Math. Newslett, vol.2, issue.1, pp.10-12, 1991.

H. Whitney, A theorem on graphs, Ann. Math, issue.2, pp.378-390, 1931.

N. Aerts and S. Felsner, Vertex Contact Representations of Paths on a Grid, Journal of Graph Algorithms and Applications, vol.19, issue.3, pp.817-849, 2015.

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

A. Asinowski, E. Cohen, M. C. Golumbic, V. Limouzy, M. Lipshteyn et al., Vertex intersection graphs of paths on a grid, J. Graph Algorithms Appl, vol.16, issue.2, pp.129-150, 2012.

I. Ben-arroyo-hartman, I. Newman, and R. Ziv, On grid intersection graphs, Discret. Math, vol.87, pp.41-52, 1991.

T. Biedl and M. Derka, 1-String B1-VPG Representations of Planar Partial 3-Trees and Some Subclasses, 2015.

T. Biedl and M. Derka, 1-String B2-VPG representation of planar graphs, Journal of Computational Geometry, vol.7, issue.2, 2016.

T. Biedl and M. Derka, The (3,1)-ordering for 4-connected planar triangulations, Journal of Graph Algorithms and Applications, vol.20, issue.2, pp.347-362, 2016.

T. Biedl and M. Derka, Order-preserving 1-string representations of planar graphs, Proceedings of SOFSEM 2017, pp.283-294, 2017.

M. M. Halldórsson, T. Hixon, and J. Stacho, Redistribution subject to SIAM license or copyright, Discrete Applied Mathematics, vol.216, pp.84-97, 2017.

J. Chalopin and D. Gonçalves, Every planar graph is the intersection graph of segments in the plane, Proceedings of the forty-first annual ACM symposium on Theory of computing, pp.631-638, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00395364

J. Chalopin, D. Gonçalves, and P. Ochem, Planar graphs have 1-string representations. Discrete & Computational Geometry, vol.43, pp.626-647, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00433091

S. Chaplick, V. Jelínek, J. Kratochvíl, and T. Vysko?il, Bend-bounded path intersection graphs: Sausages, noodles, and waffles on a grill, GraphTheoretic Concepts in Computer Science, p.274

. Springer, , 2012.

S. Chaplick, S. G. Kobourov, and T. Ueckerdt, Equilateral L-contact graphs, International Workshop on Graph-Theoretic Concepts in Computer Science, pp.139-151, 2013.

S. Chaplick and T. Ueckerdt, Planar Graphs as VPGGraphs, J. Graph Algorithms Appl, vol.17, issue.4, pp.475-494, 2013.

E. Cohen, M. C. Golumbic, W. T. Trotter, and R. Wang, Posets and VPG Graphs, Order, vol.33, issue.1, pp.39-49, 2016.

N. Castro, F. Cobos, J. C. Dana, A. Márquez, and M. Noy, Triangle-free planar graphs as segment intersection graphs, J. Graph Algorithms Appl, vol.6, issue.1, pp.7-26, 2002.

H. De-fraysseix and P. Ossona-de-mendez, Representations by contact and intersection of segments, Algorithmica, vol.47, issue.4, pp.453-463, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00138575

H. De-fraysseix, P. Ossona-de-mendez, and P. Rosenstiehl, On Triangle Contact Graphs. Combinatorics, Probability and Computing, vol.3, pp.233-246, 1994.

M. C. Francis and A. Lahiri, VPG and EPG bendnumbers of Halin graphs, Discrete Applied Mathematics, vol.215, pp.95-105, 2016.

E. R. Gansner, Y. Hu, M. Kaufmann, and S. G. Kobourov, Optimal Polygonal Representation of Planar Graphs, Algorithmica, vol.63, issue.3, pp.672-691, 2012.

D. Gonçalves, B. Lévêque, and A. Pinlou, Triangle contact representations and duality. Discrete and Computational Geometry, vol.48, pp.239-254, 2012.

B. Kappelle, Kontact-und Schnittdarstellungen planarer Graphen, 2015.

M. Kaufmann, J. Kratochvíl, K. A. Lehmann, and A. R. Subramanian, Max-tolerance graphs as intersection graphs: Cliques, cycles and recognition, Proc. SODA '06, pp.832-841, 2006.

R. W. Kenyon and S. Sheffield, Dimers, tilings and trees, J. Comb. Theor. Ser. B, vol.92, pp.295-317, 2004.

P. Koebe, Kontaktprobleme der konformen Abbildung, Ber. Sächs. Akad. Wiss. Leipzig, Math. Phys. Kl, vol.88, pp.141-164, 1936.

S. Mehrabi, Approximation Algorithms for Independence and Domination on B1-VPG and B1-EPG Graphs, 2017.

M. Middendorf and F. Pfeiffer, The max clique problem in classes of string-graphs, Discrete mathematics, vol.108, pp.365-372, 1992.

A. Ahmed, F. De-luca, S. Devkota, A. Efrat, M. I. Hossain et al., L-Graphs and Monotone L-Graphs, 2017.

E. R. Scheinerman, Intersection Classes and Multiple Intersection Parameters of Graphs, 1984.

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

O. Schramm, Combinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps. ArXiv e-prints, 2007.

H. Schrezenmaier, Homothetic triangle contact representations, Proceedings of WG '17, 2017.

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

R. ?krekovski, List improper colourings of planar graphs, Combinatorics, Probability and Computing, vol.8, issue.3, pp.293-299, 1999.

H. Whitney, A theorem on graphs, Ann. Math, vol.32, issue.2, pp.378-390, 1931.