J. Blair and B. Peyton, An Introduction to Chordal Graphs and Clique Trees Graph Theory and Sparse Matrix Computations, IMA Volumes in Mathematics and its Applications, pp.1-27

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

D. G. Corneil, S. Olariu, and L. Stewart, The Ultimate Interval Graph Recognition Algorithm, Extended Abstract) ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.175-180, 1998.

M. Habib, R. Mcconnell, C. Paul, and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, vol.234, issue.1-2, pp.59-84, 2000.
DOI : 10.1016/S0304-3975(97)00241-7

C. G. Lekkerkerker, J. Ch, and . Boland, Representation of a finite graph by a set of intervals on the real line, Fund, Math, vol.51, pp.45-64, 1962.

R. Tarjan and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035

J. A. Telle, Tree-decompositions of small pathwidth, Discrete Applied Mathematics, vol.145, issue.2
DOI : 10.1016/j.dam.2004.01.012