Pages that link to "Item:Q358644"
From MaRDI portal
The following pages link to On the outer-connected domination in graphs (Q358644):
Displaying 14 items.
- The outer-connected domination number of Sierpiński-like graphs (Q255280) (← links)
- Finding outer-connected dominating sets in interval graphs (Q495667) (← 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)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- Outer-connected domination in 2-connected cubic graphs (Q2920880) (← links)
- (Q3383029) (← links)
- Outer-weakly convex domination number of graphs (Q4957532) (← links)
- OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS (Q4973431) (← links)
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems (Q5377042) (← links)
- On the complexity of the minimum outer-connected dominating set problem in graphs (Q5963605) (← links)
- The Outer-Paired Domination of Graphs (Q6114861) (← links)