Pages that link to "Item:Q2444768"
From MaRDI portal
The following pages link to Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768):
Displaying 12 items.
- The outer-connected domination number of Sierpiński-like graphs (Q255280) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← 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)
- Bounds for the connected domination number of maximal outerplanar graphs (Q2166232) (← links)
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy (Q2692638) (← links)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← 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)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- The Outer-Paired Domination of Graphs (Q6114861) (← links)