A cograph is a graph formed from single vertices by disjoint union and complement operations, but I think it makes the theory a little cleaner to think of them as generated instead by the following set of three operations:

• vertex(): takes no arguments and returns a single vertex
• union(G,H): takes two graphs as arguments and returns their disjoint union
• join(G,H): takes two graphs as arguments and adds all possible edges connecting the two