Abstract
We show that if is a cograph, that is -free, then for any graph , . By the characterization of cographs as a finite sequence of unions and joins of , this result easily follows from that of Bartsalkin and German. However, the techniques used are new and may be useful to prove other results.
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.