期刊
JOURNAL OF GRAPH THEORY
卷 69, 期 1, 页码 46-76出版社
WILEY
DOI: 10.1002/jgt.20565
关键词
Cartesian product; domination; Vizing's conjecture
类别
资金
- Wylie Enrichment Fund
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
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据