scientific article; zbMATH DE number 1124600
From MaRDI portal
Publication:4378628
zbMATH Open0890.05035MaRDI QIDQ4378628FDOQ4378628
Authors: Douglas F. Rall, Bert L. Hartnell 
Publication date: 5 March 1998
Title of this publication is not available (Why is that?)
Recommendations
- Domination in the hierarchical product and Vizing's conjecture
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- scientific article; zbMATH DE number 2109312
- Domination of generalized Cartesian products
- On total domination in the Cartesian product of graphs
- Total domination of Cartesian products of graphs
- On domination numbers of Cartesian products of paths
- On the total domination number of Cartesian products of graphs
- Domination in digraphs and their direct and Cartesian products
- Power domination of the Cartesian product of graphs
Cited In (29)
- Domination in the hierarchical product and Vizing's conjecture
- The structure of digraphs associated with the congruence x k ≡ y (mod n)
- Thinness of product graphs
- Alliance free sets in Cartesian product graphs
- A survey of selected recent results on total domination in graphs
- On symmetric digraphs of the congruence \(x^k \equiv y \pmod n\)
- On construction for trees making the equality hold in Vizing's conjecture
- Domination in digraphs and their direct and Cartesian products
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
- Paired-domination of Cartesian products of graphs and rainbow domination
- Rainbow domination on trees
- On the 2-rainbow domination in graphs
- Bounding the \(k\)-rainbow total domination number
- Improving some bounds for dominating Cartesian products
- An improved bound in Vizing's conjecture
- The outer-connected vertex edge domination number in Cartesian product graphs
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs
- (Open) packing number of some graph products
- Vizing's conjecture for chordal graphs
- Rainbow domination in graphs
- The Cartesian product of cycles with small 2-rainbow domination number
- A result on Vizing's conjecture
- Disjoint dominating sets with a perfect matching
- Rainbow domination and related problems on strongly chordal graphs
- My top 10 graph theory conjectures and open problems
- On the upper total domination number of Cartesian products of graphs
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378628)
