1. A. Berry., A wide-range efficient algorithm for minimal triangulation. In Proceedings of SODA'99.
2. Separability generalizes Dirac's theorem;Berry;Discrete Applied Mathematics,1998
3. A. Berry, J.-P. Bordat., Triangulated and Weakly triangulated graphs: simpliciality in vertices and edges. International Conference on Graph Theory, Marseille (2000), submitted to D.A.M.
4. An introduction to chordal graphs and clique trees. Graph Theory and Sparse Matrix Computations;Blair,1993
5. Minimal elimination ordering inside a given chordal graph;Dalhaus,1997