Vizing's conjecture for cographs
From MaRDI portal
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.
This page was built for publication: Vizing's conjecture for cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6277969)