Pages that link to "Item:Q550486"

The following pages link to Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph (Q550486):

Displaying 15 items.

• Maximal 2-rainbow domination number of a graph (Q334128) (← links)
• The \(k\)-rainbow bondage number of a graph (Q400538) (← links)
• \(k\)-rainbow domatic numbers (Q423920) (← links)
• A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two (Q821316) (← links)
• Graphs with large total 2-rainbow domination number (Q1787767) (← links)
• The \(k\)-rainbow bondage number of a digraph (Q2344014) (← links)
• The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs (Q2408565) (← links)
• Rainbow reinforcement numbers in digraphs (Q2979763) (← links)
• Rainbow Domination in Graphs (Q3384615) (← links)
• (Q4583405) (← links)
• Total $k$-Rainbow domination numbers in graphs (Q4635026) (← links)
• On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles (Q4957573) (← links)
• Trees with equal total domination and 2-rainbow domination numbers (Q5014384) (← links)
• The 2-rainbow bondage number in generalized Petersen graphs (Q5193416) (← links)
• Rainbow edge domination numbers in graphs (Q5243691) (← links)