A new framework to approach Vizing's conjecture
From MaRDI portal
Publication:2656331
Recommendations
- An improved bound in Vizing's conjecture
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- Vizing's conjecture: a survey and recent results
- An Improvement in the Two-packing Bound Related to Vizing's Conjecture
- Vizing's conjecture for graphs with domination number 3 -- a new proof
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3715623 (Why is no real title available?)
- scientific article; zbMATH DE number 3229576 (Why is no real title available?)
- A result on Vizing's conjecture
- An improved bound in Vizing's conjecture
- An improved inequality related to Vizing's conjecture
- An inequality related to Vizing's conjecture
- Fair reception and Vizing's conjecture
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Some results on Vizing's conjecture and related problems
- Vizing's conjecture and the one-half argument
- Vizing's conjecture for chordal graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Vizing's conjecture: a survey and recent results
Cited in
(8)- Domination number of modular product graphs
- Domination in digraphs and their direct and Cartesian products
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- On the 2-domination Number of Cylinders with Small Cycles
- The 2-domination number of cylindrical graphs
- (Open) packing number of some graph products
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
- Domination number of Cartesian product through space projections
This page was built for publication: A new framework to approach Vizing's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656331)