1. “Asymptotic methods in enumeration”;Bender;SIAMReview,1974
2. S. Chaiken, N. V. Murray and E. Rosenthal, “An application of P4-free graphs in theorem-proving”, Annals New-York Academy of Sciences.
3. “Complement reducible graphs”;Corneil;Discrete Appl. Math.,1981
4. “Cographs: recognition, applications and algorithms”;Corneil;Proc. 15th Southeastern Conf. on Combinatorics, Graph Theory and Computing,1984
5. “A linear recognition algorithm for cographs”;Corneil;SIAM J. of Computing,1985