Pages that link to "Item:Q1758170"
From MaRDI portal
The following pages link to Complexity of distance paired-domination problem in graphs (Q1758170):
Displaying 6 items.
- The complexity of obtaining a distance-balanced graph (Q540027) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Parameterized and approximation complexity of the detection pair problem in graphs (Q5371038) (← links)