Vizing's conjecture and the one-half argument

DOI10.7151/dmgt.1018zbMath0845.05074OpenAlexW2038020887WikidataQ123015411 ScholiaQ123015411MaRDI QIDQ4882593

Douglas F. Rall, Bert L. Hartnell

Publication date: 20 August 1996

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1018

zbMATH Keywords

partitioningcliqueCartesian productdominating setdomination numberVising's conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (8)

A new framework to approach Vizing's conjecture ⋮ Domination in the hierarchical product and Vizing's conjecture ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Some improved inequalities related to Vizing's conjecture ⋮ Fair reception and Vizing's conjecture ⋮ On the \(\{k\}\)-domination number of Cartesian products of graphs ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs ⋮ Vizing's conjecture: a survey and recent results

This page was built for publication: Vizing's conjecture and the one-half argument