1. A. Bretscher, D. Corneil, M. Habib, C. Paul, A simple linear time lexbfs cograph recognition algorithm, in: H. Bodlaender (Ed.), 29th International Workshop on Graph Theoretical Concepts in Computer Science (WG’03), Lecture Notes in Computer Science, vol. 2880, 2003, pp. 119–130.
2. Graph decompositions and factorizing permutations;Capelle,1997
3. C. Crespelle, C. Paul, Fully dynamic recognition algorithm and certificate for directed cographs, in: J. Hromkovic, M. Nagl, B. Westfechtel (Eds.), 30th International Workshop on Graph Theoretical Concepts in Computer Science (WG’04), Lecture Notes in Computer Science, vol. 3353, 2004, pp. 93–104.
4. C. Crespelle, C. Paul, Fully dynamic algorithm for recognition and modular decomposition of permutation graphs, in: D. Kratsch (Ed.), 31st International Workshop on Graph Theoretical Concepts in Computer Science (WG’05), Lecture Notes in Computer Science, vol. 3787, 2005, pp. 38–48.
5. Complement reducible graphs;Corneil;Discrete Appl. Math.,1981