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

[摘要] 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 graph

[学科分类] 离散数学和组合数学

[关键词] Cartesian product;domination;Vizing's conjecture