Skip to main content
Article thumbnail
Location of Repository

A SURVEY AND RECENT RESULTS

By Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning S, Douglas F. Rall, Michael A. Henning, Sandi Klav ˇ Zar, Douglas and F. Rall

Abstract

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

Topics: Cartesian product, domination, Vizing’s conjecture
Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.417.8471
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.imfm.si/preprinti/P... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.