Vizing's Conjecture for Graphs with Domination Number 3 - a New Proof

Boštjan Brešar


Vizing's conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this note we use a new, transparent approach to prove Vizing's conjecture for graphs with domination number 3;  that is, we prove that for any graph $G$ with $\gamma(G)=3$ and an arbitrary graph $H$, $\gamma(G\Box H) \ge 3\gamma(H)$.


Cartesian product; domination; Vizing's conjecture

Full Text: