Triangle-free planar graphs as segment intersection graphs, J. Graph Algorithms Appl, vol.6, issue.1, pp.7-26, 2002. ,
Every planar graph is the intersection graph of segments in the plane: extended abstract, Proceedings of the forty-first annual ACM symposium on Theory of computing, pp.631-638, 2009.,
URL : https://hal.archives-ouvertes.fr/lirmm-00395364
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. ,
, Triangle Contact Representations. Midsummer Combinatorial Workshop, 2009.
Rectangle and Square Representations of Planar Graphs, Thirty Essays on Geometric Graph Theory, 2013. ,
, Equiangular Polygon Contact Representations Proc. of WG 2018, vol.11159, pp.203-215, 2018.
, Representations by Contact and Intersection of Segments. Algorithmica, vol.47, pp.453-463, 2007.
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
Planar Graphs as L-intersection or L-contact graphs, Proc., pp.172-184, 2018. ,
Triangle Contact Representations and Duality, Proc. of GD 2010, vol.6502, pp.262-273, 2011. ,
On grid intersection graphs, Discrete Math, vol.87, issue.1, pp.41-52, 1991. ,
String graphs. II. Recognizing String Graphs is NP-hard, J. Combin. Theory. Ser. B, vol.52, pp.67-78, 1991. ,
Bertinoro Workshop on Graph Drawing, 2007. ,
Intersection Graphs of Segments, J. Combin. Theory. Ser. B, vol.62, pp.180-181, 1994. ,
The Chromatic Number of a Signed Graph, Elec. J. of Combinatorics, vol.23, issue.1, 2016. ,
Crossing Patterns of Segments, J. Combin. Theory. Ser. A, vol.96, pp.316-325, 2001. ,
Intersection classes and multiple intersection parameters of graphs, 1984. ,
Open problems, SIAM J. Discrete Math. Newslett, vol.2, issue.1, pp.10-12, 1991. ,