1. A. Cournier and M. Habib. An efficient algorithm to recognize prime undirected graphs. In E. W. Mayr, editor, Lectures notes in Computer Science, 657.Graph-Theoretic Concepts in Computer Science. 18th International Workshop, WG'92. Wiesbaden-Naurod, Germany, June 1992. Proceding, pages 212–224. Springer-Verlag, 1993.
2. A. Cournier and M. Habib. A new linear algorithm for modular decomposition. Raport de recherche, LIRMM, 161, Rue Ada, 34392 Montpellier Cedex 5, 1993.
3. M. Chein, M. Habib, and M. C. Maurer. Partitive hypergraphs. Discrete Mathematics, (37):35–50, 1981.
4. D. D. Cowan, L. O. James, and R. G. Stanton. Graph decomposition for undirected graphs. In R. B. Levow eds. F. Hoffman, editor, 3rd S-E Conf. Combinatorics, Graph Theory and computing, Utilitas Math, pages 281–290, Winnipeg, 1972.
5. A. Cournier. Sur Quelques Algorithmes de Décomposition de Graphes. PhD thesis, Université Montpellier II, 161 rue Ada, 34392 Montpellier Cedex 5, France, février 1993.