scientific article; zbMATH DE number 1124600

From MaRDI portal
Revision as of 00:27, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4378628

zbMath0890.05035MaRDI QIDQ4378628

Douglas F. Rall, Bert L. Hartnell

Publication date: 5 March 1998


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

The outer-connected vertex edge domination number in Cartesian product graphsThinness of product graphsOn the domination number of the Cartesian product of the cycle of length \(n\) and any graphVizing's conjecture for graphs with domination number 3 -- a new proofOn construction for trees making the equality hold in Vizing's conjectureDomination in digraphs and their direct and Cartesian products(Open) packing number of some graph productsDisjoint dominating sets with a perfect matchingA result on Vizing's conjectureRainbow domination and related problems on strongly chordal graphsAlliance free sets in Cartesian product graphsOn the 2-rainbow domination in graphsOn the upper total domination number of Cartesian products of graphsThe Cartesian product of cycles with small 2-rainbow domination numberRainbow domination on treesImproving the Clark-Suen bound on the domination number of the Cartesian product of graphsTowards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squaresBounding the \(k\)-rainbow total domination numberA survey of selected recent results on total domination in graphsAn improved bound in Vizing's conjectureRainbow Domination in GraphsVizing's conjecture for chordal graphsOn symmetric digraphs of the congruence \(x^k \equiv y \pmod n\)A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphsThe structure of digraphs associated with the congruence x k ≡ y (mod n)My Top 10 Graph Theory Conjectures and Open ProblemsPaired-domination of Cartesian products of graphs and rainbow domination







This page was built for publication: