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 Symposium on theory of computing - STOC '09, pp.631-638, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00395364

G. Chartrand and H. V. Kronk, The Point-Arboricity of Planar Graphs, Journal of the London Mathematical Society, vol.s1-44, issue.1, pp.612-616, 1969.

L. J. Cowen, R. H. Cowen, and D. R. Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, Journal of Graph Theory, vol.10, issue.2, pp.187-195, 1986.

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, Information Processing Letters, vol.66, issue.3, pp.125-126, 1998.

H. De-fraysseix, P. O. De-mendez, and J. Pach, A left-first search algorithm for planar graphs, Discrete & Computational Geometry, vol.13, issue.3-4, pp.459-468, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00005623

J. ?erný, D. Král, H. Nyklová, and O. Pangrác, On Intersection Graphs of Segments with Prescribed Slopes, Graph Drawing, vol.2265, pp.261-271, 2002.

D. Gonçalves, 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes, Graph-Theoretic Concepts in Computer Science, vol.11789, pp.351-363, 2019.

D. Gonçalves, L. Isenmann, and C. Pennarun, Planar Graphs as L-intersection or L-contact graphs, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.172-184, 2018.

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

F. Kardo? and J. Narboni, On the 4-color theorem for signed graphs, European Journal of Combinatorics, vol.91, p.103215, 2021.

J. Kratochvíl and J. , Kratochvíl, Augustin

. Matou?ek, Intersection graphs of segments, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.289-315, 1994.

E. Má?ajová, A. Raspaud, and M. ?koviera, The Chromatic Number of a Signed Graph, The Electronic Journal of Combinatorics, vol.23, issue.1, pp.1-14, 2016.

E. Scheinerman, Characterizing intersection classes of graphs, Discrete Mathematics, vol.55, issue.2, pp.185-193, 1985.

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

T. Zaslavsky, Signed graph coloring, Discrete Mathematics, vol.39, issue.2, pp.215-228, 1982.