The following pages link to Rainbow domination in graphs (Q928382):
Displaying 50 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Averaging 2-rainbow domination and Roman domination (Q266967) (← links)
- Maximal 2-rainbow domination number of a graph (Q334128) (← links)
- On the complexity of reinforcement in graphs (Q339476) (← links)
- On the rainbow domination number of digraphs (Q343745) (← links)
- Bounds on the 2-rainbow domination number of graphs (Q354420) (← links)
- The \(k\)-rainbow bondage number of a graph (Q400538) (← links)
- \(k\)-rainbow domatic numbers (Q423920) (← links)
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\) (Q489721) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← links)
- On rainbow domination numbers of graphs (Q497921) (← links)
- The Cartesian product of cycles with small 2-rainbow domination number (Q498440) (← links)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph (Q550486) (← links)
- Some results on Vizing's conjecture and related problems (Q714041) (← links)
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees (Q726513) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- On \(k\)-rainbow domination in regular graphs (Q777421) (← links)
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two (Q821316) (← links)
- Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\) (Q967299) (← links)
- Rainbow domination on trees (Q968106) (← links)
- Note on 2-rainbow domination and Roman domination in graphs (Q972956) (← links)
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\) (Q1026161) (← links)
- Upper bound on 3-rainbow domination in graphs with minimum degree 2 (Q1662645) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Independent Roman \(\{2 \}\)-domination in graphs (Q1693166) (← links)
- Weak \(\{2\}\)-domination number of Cartesian products of cycles (Q1698059) (← links)
- On 2-rainbow domination of generalized Petersen graphs (Q1730265) (← links)
- General upper bounds on independent \(k\)-rainbow domination (Q1732101) (← links)
- Graphs with large total 2-rainbow domination number (Q1787767) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
- Italian domination in the Cartesian product of paths (Q2025085) (← links)
- Italian domination of Cartesian products of directed cycles (Q2028072) (← links)
- Bounding the \(k\)-rainbow total domination number (Q2032845) (← links)
- Total domination in generalized prisms and a new domination invariant (Q2042628) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- Computing strong Roman domination of trees and unicyclic graphs in linear time (Q2082401) (← links)
- A note on the bounds of Roman domination numbers (Q2144876) (← links)
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number (Q2151206) (← links)
- Rainbow domination numbers of generalized Petersen graphs (Q2185448) (← links)
- Total 2-rainbow domination numbers of trees (Q2227097) (← links)
- Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice (Q2306596) (← links)
- 2-rainbow domination stability of graphs (Q2331591) (← links)
- On \(k\)-rainbow independent domination in graphs (Q2335156) (← links)
