The following pages link to (Q4953552):
Displaying 16 items.
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Onk-tuple domination of random graphs (Q735107) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- Proof of a conjecture on \(k\)-tuple domination in graphs (Q958895) (← links)
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) (Q2147590) (← links)
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933) (← links)
- (Q2981134) (← links)
- (Q3139277) (← links)
- A note on the k-tuple domination number of graphs (Q5037921) (← links)
- <i>k</i>-tuple restrained domination in graphs (Q5163030) (← links)
- Roman k-tuple domination number of a graph (Q5164960) (← links)
- (Q5377028) (← links)
- A note on the \(k\)-tuple total domination number of a graph (Q5964651) (← links)
