Pages that link to "Item:Q721940"
From MaRDI portal
The following pages link to Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940):
Displaying 12 items.
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Disjunctive domination in graphs with minimum degree at least two (Q6041864) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs (Q6114823) (← links)
- (Q6155858) (← links)
- Total 2-rainbow domination in graphs: complexity and algorithms (Q6629672) (← links)