Abstract
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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.