The following pages link to (Q3059038):
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)
- Outer-\(k\)-connected component domination in graphs (Q656132) (← links)
- 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)
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- On the number of outer connected dominating sets of graphs (Q2860813) (← links)
- Outer-connected domination in 2-connected cubic graphs (Q2920880) (← links)
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747) (← links)
- Total outer-connected domination in trees (Q2997598) (← links)
- Outer-weakly convex domination number of graphs (Q4957532) (← links)
- OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS (Q4973431) (← links)
- On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)
- The Outer-Paired Domination of Graphs (Q6114861) (← links)