B. , K. S. Booth, and G. S. Leuker, Testing for the consecutive ones property , interval graphs and graph planarity using pq-tree algorithm, J. Comput. Syst. Sci, vol.13, pp.335-379, 1976.

C. , D. G. Corneil, S. Olariu, and L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, 1995.

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835

]. F. Gav74 and . Gavril, The intersection graphs of a path in a tree are exactly the chordal graphs, Journ. Comb. Theory, vol.16, pp.47-56, 1974.

G. P. Galinier, M. Habib, and C. Paul, Chordal graphs and their clique graphs, Graph-Theoretic Concepts in Computer Science, WG'95, pp.358-371, 1995.
DOI : 10.1007/3-540-60618-1_88

M. C. Golumbic, Algorithms Graph Theory and Perfect Graphs, 1980.

]. A. Hil93 and . Hilali, Ordres de contiguit e, 1993.

H. Hsu and M. , Substitution decomposition on chordal graphs and applications, Proceedings of the 2nd ACM-SIGSAM Internationnal Symposium on Symbolic and Algebraic Computation, number 557, 1991.
DOI : 10.1007/3-540-54945-5_49

K. , N. Kortee, and R. Mm, An incremental linear-time algorithm for recognizing interval graphs, SIAM J. of Comput, vol.18, pp.68-81, 1989.

R. M. Mcconnell and J. P. Spinrad, Linear-time modular decomposition and eecient transitive orientation of comparability graphs, Proc. of SODA, pp.536-545, 1994.

D. J. Rose, R. Endre-tarjan, and G. S. Leuker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021