Should the empty graph be defined as cograph?It can not be made from 1-vertex graphs by disjoint union and complementation, so it is not. OTOH it has no induced subgraph isomorphic to 4-vertex path, and it is the comparibility graph of the empty poset, so it kind of is.
-- Jori Mäntysalo
