加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本