pith. sign in

arxiv: 1609.08370 · v3 · pith:NPRPQUQQnew · submitted 2016-09-27 · 🧮 math.CO

Vizing's conjecture for cographs

classification 🧮 math.CO
keywords gammacographsbartsalkincharacterizationcographconjectureeasilyfinite
0
0 comments X
read the original abstract

We show that if $G$ is a cograph, that is $P_4$-free, then for any graph $H$, $\gamma(G\square H)\geq \gamma(G)\gamma(H)$. By the characterization of cographs as a finite sequence of unions and joins of $K_1$, 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 paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.