The k-rainbow domatic number of a graph
From MaRDI portal
Recommendations
Cited in
(30)- Upper bound on 3-rainbow domination in graphs with minimum degree 2
- On 2-rainbow domination of generalized Petersen graphs
- General upper bounds on independent \(k\)-rainbow domination
- Graphs with large total 2-rainbow domination number
- The \(k\)-rainbow bondage number of a digraph
- General bounds on rainbow domination numbers
- Rainbow reinforcement numbers in digraphs
- The k-rainbow domination and domatic numbers of digraphs
- Maximal 2-rainbow domination number of a graph
- Rainbow domination in graphs
- Independent 2-rainbow domination in trees
- The k-rainbow bondage number of a graph
- k-rainbow domatic numbers
- scientific article; zbMATH DE number 6929515 (Why is no real title available?)
- Total \(k\)-rainbow domination numbers in graphs
- Mixed \(k\)-rainbow domination numbers in graphs
- On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
- Trees with equal total domination and 2-rainbow domination numbers
- On k-rainbow domination in middle graphs
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- The k-rainbow reinforcement numbers in graphs
- Global rainbow domination in graphs
- Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph
- Total k-rainbow reinforcement number in graphs
- Restrained k-rainbow reinforcement number in graphs
- Domination-related parameters in middle graphs
- The \(l\)-distance \(k\)-rainbow domination numbers of graphs
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- On \(k\)-rainbow domination in regular graphs
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
This page was built for publication: The \(k\)-rainbow domatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906372)