Pages that link to "Item:Q5963605"
From MaRDI portal
The following pages link to On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605):
Displaying 4 items.
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
- Domination and outer connected domination in maximal outerplanar graphs (Q2053729) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
