Asymptotic enumeration of cographs

We consider here labelled and unlabelled cographs, i.e., graphs without induced P4, whose applications are important in computer science and logic, because of their representation by means of parse trees. After a new (analytical) approach for obtaining generating functions associated to parse trees, we solve the open problem of asymptotic estimates for the numbers of unlabelled and labelled cographs.