  We show that every countable cograph has either one or infinitely many
siblings. This answers, very partially, a conjecture of Thomass\'e. The main
tools are the notion of well quasi ordering and the correspondence between
cographs and some labelled ordered trees.
