We show that every countable cograph has either one or infinitely many siblings. This answers, very partially, a conjecture of Thomassé. The main tools are the notion of well quasi ordering and the correspondence between cographs and some labelled ordered trees.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。