Get access

Vizing's conjecture: a survey and recent results

Authors


Abstract

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 paper we survey the approaches to this central conjecture from domination theory and give some new results along the way. For instance, several new properties of a minimal counterexample to the conjecture are obtained and a lower bound for the domination number is proved for products of claw-free graphs with arbitrary graphs. Open problems, questions and related conjectures are discussed throughout the paper. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 46–76, 2012

Ancillary