Journal
JOURNAL OF GRAPH THEORY
Volume 69, Issue 1, Pages 46-76Publisher
WILEY
DOI: 10.1002/jgt.20565
Keywords
Cartesian product; domination; Vizing's conjecture
Categories
Funding
- Wylie Enrichment Fund
Ask authors/readers for more resources
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. (C) 2011 Wiley Periodicals, Inc. J Graph Theory 68:46-76, 2011
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available