K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

A. Brandstt-adt, Classes of bipartite graphs related to chordal graphs, Discrete Applied Mathematics, vol.32, issue.1, pp.51-60, 1991.
DOI : 10.1016/0166-218X(91)90023-P

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, Trees in algebra and programming|CAAP 94 (Edinburgh) Lecture Notes in Computer Science, pp.68-84, 1994.
DOI : 10.1007/BFb0017474

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, EEcient and practical modular decomposition, Proceedings of the seventh annual ACM-SIAM Symposium on Discrete Algorithm, pages 26{35. Society of Industrial and Applied Mathematics (SIAM), 1997.

P. Galinier, M. Habib, and C. Paul, Chordal graphs and their clique graphs, Theoretic Concepts in Computer Science, WG'95 21st Internationnal Workshop WG'95, pp.358-371, 1995.
DOI : 10.1007/3-540-60618-1_88
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.9635

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.1, pp.47-56, 1974.
DOI : 10.1016/0095-8956(74)90094-X

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

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

N. Korte and R. Mm, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs, SIAM Journal on Computing, vol.18, issue.1, pp.68-81, 1989.
DOI : 10.1137/0218005

R. M. Mcconnell and J. P. Spinrad, Linear-time modular decomposition and eecient transitive orientation of comparability graphs, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.536-545, 1994.

R. M. Mcconnell and J. P. Spinrad, Linear-time modular decomposition and eecient transitive orientation of undirected graphs, Proceedings of the seventh annual ACM-SIAM Symposium on Discrete Algorithm, pages 19{35. Society of Industrial and Applied Mathematics (SIAM), 1997.

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

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