Pages that link to "Item:Q896660"
From MaRDI portal
The following pages link to Complexity of total outer-connected domination problem in graphs (Q896660):
Displaying 8 items.
- Outer-\(k\)-connected component domination in graphs (Q656132) (← links)
- On the computational complexity of upper total domination (Q1421481) (← links)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747) (← links)
- Complexity of Total {k}-Domination and Related Problems (Q3004664) (← links)
- On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)