Pages that link to "Item:Q1758170"

The following pages link to Complexity of distance paired-domination problem in graphs (Q1758170):

Displaying 2 items.

• \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
• Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)