A. Bretscher, D. G. Corneil, M. Habib, and C. Paul, A Simple Linear Time LexBFS Cograph Recognition Algorithm, Graph-Theoretic 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, Decomposition de graphes et permutations factorisantes, 1997.

C. Capelle, M. Habib, and F. De-montgolfier, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.55-70, 2002.
DOI : 10.1109/ISTCS.1997.595165

URL : https://hal.archives-ouvertes.fr/hal-00958972

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. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, 19th International ColloquiumTrees in Algebra and Programming, CAAP'94, pp.68-82, 1994.
DOI : 10.1007/BFb0017474

E. Dahlhaus, Efficient parallel recognition algorithms of cographs and distance hereditary graphs, Discrete Applied Mathematics, vol.57, issue.1, pp.29-54, 1995.
DOI : 10.1016/0166-218X(93)E0138-O

E. Dahlhaus, J. Gustedt, and R. M. Mcconnell, Efficient and Practical Algorithms for Sequential Modular Decomposition, Journal of Algorithms, vol.41, issue.2, pp.360-387, 2001.
DOI : 10.1006/jagm.2001.1185

URL : https://hal.archives-ouvertes.fr/inria-00072855

G. Damiand, M. Habib, and C. Paul, A simple paradigm for graph recognition: application to cographs and distance hereditary graphs, Theoretical Computer Science, vol.263, issue.1-2, pp.99-111, 2001.
DOI : 10.1016/S0304-3975(00)00234-6

URL : https://hal.archives-ouvertes.fr/lirmm-00090372

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

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

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

M. Habib, C. Paul, and L. Viennot, Linear time recognition of p 4 indifference graphs, Discrete Mathematics and Theoretical Computer Science, vol.4, issue.2, pp.173-178, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072882

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, 1991.
DOI : 10.1007/3-540-54945-5_49

B. Jamison and S. Olariu, A New Class of Brittle Graphs, Studies in Applied Mathematics, vol.16, issue.1, pp.89-92, 1989.
DOI : 10.1002/sapm198981189

B. Jamison and S. Olariu, -Reducible Graphs-Class of Uniquely Tree-Representable Graphs, Studies in Applied Mathematics, vol.18, issue.1, pp.79-87, 1989.
DOI : 10.1002/sapm198981179

URL : https://hal.archives-ouvertes.fr/hal-00845249

B. Jamison and S. Olariu, A tree representation for P4-sparse graphs, Discrete Applied Mathematics, vol.35, issue.2, pp.115-129, 1992.
DOI : 10.1016/0166-218X(92)90036-A

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

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

V. Raghavan and J. Spinrad, Robust algorithms for restricted domains, Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms, pp.460-467, 2001.
DOI : 10.1016/S0196-6774(03)00048-8

S. Seinsche, On a property of the class of n-colorable graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.2, pp.191-193, 1974.
DOI : 10.1016/0095-8956(74)90063-X