Pages that link to "Item:Q2015786"
From MaRDI portal
The following pages link to On the total outer-connected domination in graphs (Q2015786):
Displaying 17 items.
- The outer-connected domination number of Sierpiński-like graphs (Q255280) (← links)
- On the outer-connected domination in graphs (Q358644) (← links)
- Finding outer-connected dominating sets in interval graphs (Q495667) (← links)
- A note on the total outer-connected domination number of a tree (Q547559) (← links)
- Outer-\(k\)-connected component domination in graphs (Q656132) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- Total outer-connected domination numbers of trees (Q967375) (← links)
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- Generalization of the total outer-connected domination in graphs (Q2805478) (← links)
- Total outer-connected domination subdivision numbers in graphs (Q2864851) (← links)
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747) (← links)
- Total outer-connected domination in trees (Q2997598) (← links)
- (Q3059038) (← links)
- Outer-weakly convex domination number of graphs (Q4957532) (← links)
- On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)
- (Q6158951) (← links)