Pages that link to "Item:Q2062683"
From MaRDI portal
The following pages link to The semitotal domination problem in block graphs (Q2062683):
Displaying 8 items.
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- (Q3445045) (← links)
- (Q3550224) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
- Extremal edge general position sets in some graphs (Q6131296) (← links)