The k-rainbow domatic number of a graph
From MaRDI portal
Publication:2906372
DOI10.7151/DMGT.1591zbMath1255.05139OpenAlexW2017796724MaRDI QIDQ2906372
Lutz Volkmann, Seyyed Mahmoud Sheikholeslami
Publication date: 5 September 2012
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1591
Related Items (20)
On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles ⋮ A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two ⋮ Independent 2-rainbow domination in trees ⋮ Maximal 2-rainbow domination number of a graph ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ The \(k\)-rainbow bondage number of a graph ⋮ \(k\)-rainbow domatic numbers ⋮ Rainbow reinforcement numbers in digraphs ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ The \(k\)-rainbow reinforcement numbers in graphs ⋮ Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph ⋮ Graphs with large total 2-rainbow domination number ⋮ Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees ⋮ Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers ⋮ Unnamed Item ⋮ Rainbow Domination in Graphs ⋮ Total $k$-Rainbow domination numbers in graphs ⋮ Total k-rainbow reinforcement number in graphs ⋮ Trees with equal total domination and 2-rainbow domination numbers ⋮ The \(k\)-rainbow bondage number of a digraph
This page was built for publication: The k-rainbow domatic number of a graph