Pages that link to "Item:Q1634760"
From MaRDI portal
The following pages link to Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760):
Displaying 5 items.
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Upper paired domination versus upper domination (Q5024681) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
