A. Bretscher, D. G. Corneil, M. Habib, and C. Paul, A Simple Linear Time LexBFS Cograph Recognition Algorithm, 29th International Workshop on Graph Theoretical Concepts in Computer Science (WG'03), number 2880 in Lecture Notes in Computer Science, pp.119-130, 2003.
DOI : 10.1137/060664690
URL : https://hal.archives-ouvertes.fr/lirmm-00269525

C. Capelle and M. Habib, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.132-143, 1997.
DOI : 10.1109/ISTCS.1997.595165
URL : https://hal.archives-ouvertes.fr/hal-00958972

D. G. Corneil, H. Lerchs, and L. S. Burlingham, Complement reducible graphs, Discrete Applied Mathematics, vol.3, issue.3, pp.163-174, 1981.
DOI : 10.1016/0166-218X(81)90013-5
URL : http://doi.org/10.1016/0166-218x(81)90013-5

D. G. Corneil, Y. Perl, and L. K. Stewart, A Linear Recognition Algorithm for Cographs, SIAM Journal on Computing, vol.14, issue.4, pp.926-934, 1985.
DOI : 10.1137/0214065

A. Ehrenfeucht and G. Rozenberg, Primitivity is hereditary for 2-structures, Theoretical Computer Science, vol.70, issue.3, pp.343-359, 1990.
DOI : 10.1016/0304-3975(90)90131-Z

J. Fouquet, V. Giakoumakis, and J. Vanherpe, BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION, International Journal of Foundations of Computer Science, vol.10, issue.04, pp.513-533, 1999.
DOI : 10.1142/S0129054199000368
URL : https://hal.archives-ouvertes.fr/hal-00467645

V. Giakoumakis and J. Vanherpe, -FREE GRAPHS, International Journal of Foundations of Computer Science, vol.14, issue.01, pp.107-136, 2003.
DOI : 10.1142/S0129054103001625
URL : https://hal.archives-ouvertes.fr/hal-00999308

P. Hell, R. Shamir, and R. Sharan, A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs, SIAM Journal on Computing, vol.31, issue.1, pp.289-305, 2002.
DOI : 10.1137/S0097539700372216

L. Ibarra, Fully dynamic algorithms for chordal graphs, 10th ACM-SIAM Annual Symposium on Discrete Algorithm (SODA'03), pp.923-924, 1999.

D. Kratsch, R. M. Mcconnell, K. Mehlhorn, and J. P. Spinrad, Certifying algorithm for recognition of interval graphs and permutation graphs, 14th ACM-SIAM Annual Symposium on Discrete Algorithm (SODA'03), pp.153-167, 2003.

E. L. Lawler, Graphical algorithm and their complexity, Mathematical center tracts, vol.81, pp.3-32, 1976.

R. H. Möhring and F. J. Radermacher, Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization, Annals of Discrete Mathematics, vol.19, pp.257-356, 1984.
DOI : 10.1016/S0304-0208(08)72966-9

R. Shamir and R. Sharan, A fully dynamic algorithm for modular decomposition and recognition of cographs, Discrete Applied Mathematics, vol.136, issue.2-3, pp.329-340, 2004.
DOI : 10.1016/S0166-218X(03)00448-7

J. Valdes, R. E. Tarjan, and E. L. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.
DOI : 10.1137/0211023