K. S. Booth and G. S. Lueker, Linear algorithms to recognize interval graphs and test for the consecutive ones property, Proceedings of seventh annual ACM symposium on Theory of computing , STOC '75, pp.255-265, 1975.
DOI : 10.1145/800116.803776

A. Brandstädt, . Van-bang, J. P. Le, and . Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM), 1999.
DOI : 10.1137/1.9780898719796

A. Brandstädt, J. Spinrad, and L. Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Eighteenth Southeastern International Conference on Combinatorics , Graph Theory, and Computing, pp.165-174, 1987.

D. E. Brown, Variations on Interval Graphs, 2004.

D. E. Brown and L. J. Langley, Probe interval orders The Mathematics of Preference Choice and Order, Essays in Honor of P. C. Fishburn, chapter 18, pp.313-322, 2009.

D. E. Brown and J. R. Lundgren, Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs, Australas. J. Combin, vol.35, pp.221-236, 2006.

A. H. Busch, A characterization of triangle-free tolerance graphs, Discrete Applied Mathematics, vol.154, issue.3, pp.471-477, 2006.
DOI : 10.1016/j.dam.2005.06.010

A. H. Busch and G. Isaak, Recognizing Bipartite Tolerance Graphs in Linear Time, Lecture Notes in Comput. Sci, vol.4769, pp.12-20, 2007.
DOI : 10.1007/978-3-540-74839-7_2

G. J. Chang, A. J. Kloks, J. Liu, and S. Peng, The PIGs Full Monty ??? A Floor Show of Minimal Separators, STACS 2005, pp.521-532, 2005.
DOI : 10.1007/978-3-540-31856-9_43

O. G. Dergis, U. , and R. Schrader, Bisimplicial edges, gaussian elimination and matchings in bipartite graphs, Workshop in Graph Theoretic Concepts in Comp. Sci, pp.79-87, 1984.

M. C. Golumbic and M. Lipshteyn, Chordal probe graphs, Discrete Applied Mathematics, vol.143, issue.1-3, pp.221-237, 2004.
DOI : 10.1016/j.dam.2003.12.009
URL : https://hal.archives-ouvertes.fr/hal-00678308

M. C. Golumbic and C. L. Monma, A generalization of interval graphs with tolerances, Proceedings of the thirteenth Southeastern conference on combinatorics, graph theory and computing, pp.321-331, 1982.

M. C. Golumbic, C. L. Monma, W. T. Trotter, and J. , Tolerance graphs, Discrete Applied Mathematics, vol.9, issue.2, pp.157-170, 1984.
DOI : 10.1016/0166-218X(84)90016-7
URL : http://doi.org/10.1016/0166-218x(84)90016-7

M. C. Golumbic and A. N. Trenk, Tolerance graphs, volume 89 of Cambridge Studies in Advanced Mathematics, 2004.

R. B. Hayward and R. Shamir, A note on tolerance graph recognition, Discrete Applied Mathematics, vol.143, issue.1-3, pp.307-311, 2004.
DOI : 10.1016/j.dam.2003.08.012

P. Hell and J. Huang, Interval bigraphs and circular arc graphs, Journal of Graph Theory, vol.178, issue.4, pp.313-327, 2004.
DOI : 10.1002/jgt.20006
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.7538

J. L. Johnson and J. P. Spinrad, A polynomial time recognition algorithm for probe interval graphs, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.477-486, 2001.

F. R. Mcmorris, C. Wang, and P. Zhang, On probe interval graphs, Discrete Applied Mathematics, vol.88, issue.1-3, pp.315-324, 1998.
DOI : 10.1016/S0166-218X(98)00077-8

G. B. Mertizios, I. Sau, and S. Zaks, The Recognition of Tolerance and Bounded Tolerance Graphs, Symposium on Theoretical Aspects of Computer Science, pp.585-596, 2010.
DOI : 10.1137/090780328

H. Müller, Recognizing interval digraphs and interval bigraphs in polynomial time, Discrete Applied Mathematics, vol.78, issue.1-3, pp.189-205, 1997.
DOI : 10.1016/S0166-218X(97)00027-9

R. M. Mcconnell and J. P. Spinrad, Construction of probe interval models, Proc. 13th ACM- SIAM Symp. on Discrete Algs. (SODA02), pp.866-875, 2002.

L. Sheng, Cycle free probe interval graphs, Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, pp.33-42, 1999.

J. P. Spinrad, A. Brandstädt, and L. Stewart, Bipartite permutation graphs, Discrete Applied Mathematics, vol.18, issue.3, pp.279-292, 1987.
DOI : 10.1016/S0166-218X(87)80003-3
URL : http://doi.org/10.1016/s0166-218x(87)80003-3

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

A. Tucker, A structure theorem for the consecutive 1's property, Journal of Combinatorial Theory, Series B, vol.12, issue.2, pp.153-162, 1972.
DOI : 10.1016/0095-8956(72)90019-6

P. Zhang, Probe interval graphs and its applications to physical mapping of DNA. manuscript, 1994. [27] P. Zhang. Methods of mapping DNA fragments. United States Patent, 1997.

P. Zhang, E. A. Schon, S. F. Fischer, E. Cayanis, J. Weiss et al., An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA, Bioinformatics, vol.10, issue.3, pp.309-317, 1994.
DOI : 10.1093/bioinformatics/10.3.309