Vizing's conjecture and the one-half argument

DOI10.7151/DMGT.1018zbMATH Open0845.05074OpenAlexW2038020887WikidataQ123015411 ScholiaQ123015411MaRDI QIDQ4882593FDOQ4882593

Authors: 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

Recommendations

• On Vizing's conjecture
• scientific article; zbMATH DE number 2197881
• A result on Vizing's conjecture
• An inequality related to Vizing's conjecture

zbMATH Keywords

domination numberdominating setcliqueCartesian productpartitioningVising's conjecture

Mathematics Subject Classification ID

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

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882593)