]. T. Bil92 and . Bilski, Embedding graphs in books: A survey, IEE Proceedings-E, vol.139, issue.2, pp.134-138, 1992.

F. Bernhart and P. C. Kainen, The book thickness of a graph, Journal of Combinatorial Theory, Series B, vol.27, issue.3, pp.320-331, 1979.
DOI : 10.1016/0095-8956(79)90021-2

V. [. Brandstädt, J. P. Le, and . Spinrad, Graph Classes: A Survey, 1999.
DOI : 10.1137/1.9780898719796

U. [. Bondy and . Murty, Graph Theory. Graduate Texts in Mathematics Series, 2007.

S. [. Catanzaro, S. Chaplick, B. V. Felsner, M. M. Halldórsson, T. Halldórsson et al., Max point-tolerance graphs, Discrete Applied Mathematics, vol.216
DOI : 10.1016/j.dam.2015.08.019

URL : http://arxiv.org/abs/1508.03810

L. [. Correa and J. A. Feuilloley, Soto Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line, Proceedings of the eleventh annual Latin American Theoretical INformatics Symposium., LATIN '14, pp.35-46, 2014.

A. [. Erdös, L. Goodman, and . Posa, The representation of a graph by set intersections, Journal canadien de math??matiques, vol.18, issue.0, 1964.
DOI : 10.4153/CJM-1966-014-3

M. Farach-colton, R. J. Fernandes, and M. A. Mosteiro, Bootstrapping a hop-optimal network in the weak sensor model, ACM Transactions on Algorithms, vol.5, issue.4, 2009.

C. [. Golumbic and . Monma, A generalization of interval graphs with tolerances, Combinatorica, 1982.

]. M. Gol04 and . Golumbic, Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, 2004.

A. [. Golumbic and . Trenk, Tolerance Graphs. Cambridge Studies in Advanced Mathematics, 2004.
DOI : 10.1016/0166-218x(84)90016-7

URL : http://doi.org/10.1016/0166-218x(84)90016-7

]. E. Gyö84, . S. Györihix13-]-t, and . Hixon, A minimax theorem on intervals Hook graphs and more: Some contributions to geometric graph theory, Journal of Combinatorial Theory, Series B, vol.37, issue.1, pp.1-9, 1984.

P. Hlineny and J. Kratochvíl, Representing graphs by disks and balls (a survey of recognition-complexity results), Discrete Mathematics, vol.229, issue.1-3, pp.101-124, 2001.
DOI : 10.1016/S0012-365X(00)00204-1

M. Kaufmann, J. Kratochvíl, K. A. Lehmann, and A. R. Subramanian, Max-tolerance graphs as intersection graphs, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.832-841, 2006.
DOI : 10.1145/1109557.1109649

]. P. Koe36 and . Koebe, Kontaktprobleme der konformen abbildung Berichtë uber die Verhand-lungen de Sächsischen, Akad. Wiss. Leipzig, Math.-Phys, vol.88, pp.141-164, 1936.

R. [. Kuhn, A. Wattenhofer, and . Zollinger, Ad hoc networks beyond unit disk graphs, Wireless Networks, vol.12, issue.4, pp.715-729, 2008.
DOI : 10.1007/s11276-007-0045-6

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.8351

]. A. Lub91 and . Lubiw, A weighted min-max relation for intervals, Journal of Combinatorial Theory, Series B, vol.53, issue.2, pp.151-172, 1991.

T. A. Mckee and F. R. Mcmorris, Topics in Intersection Graph Theory, Siam Monographs on Discrete Mathematics and Applications. Siam, 1999.
DOI : 10.1137/1.9780898719802

]. S. Ola91 and . Olariu, An optimal greedy heuristic to color interval graphs, Information Processing Letters, vol.37, issue.1, pp.21-25, 1991.

]. F. Rob69a and . Roberts, Indifference graphs, Proof Techniques in Graph Theory, pp.139-146, 1969.

]. F. Rob69b and . Roberts, On the boxicity and cubicity of a graph Academic press, Recent progress in combinatorics, pp.301-310, 1969.

[. and E. Sur, Sur deux propriétés des classes d'ensembles. (french), Fundamenta Mathematicae, vol.33, issue.1, pp.303-307, 1945.

]. J. Spi03 and . Spinrad, Efficient Graph Representations.: The Fields Institute for Research in Mathematical Sciences . Fields Institute Monographs, 19, 2003.

]. A. Tuc72 and . Tucker, A structure theorem for the consecutive 1's property, Journal of Combinatorial Theory, Series B, vol.12, issue.2, pp.153-162, 1972.

J. [. Waterman and . Griggs, Interval graphs and maps of DNA, Bulletin of Mathematical Biology, vol.48, issue.2, pp.189-195, 1986.
DOI : 10.1016/S0092-8240(86)80006-4