The following pages link to (Q3421937):
Displayed 13 items.
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- Which trees have a differentiating-paired dominating set? (Q543501) (← links)
- Graphs with disjoint dominating and paired-dominating sets (Q607427) (← links)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- A characterization of graphs with disjoint dominating and paired-dominating sets (Q719018) (← links)
- Upper paired-domination in claw-free graphs (Q719019) (← links)
- Paired-domination subdivision numbers of graphs (Q844217) (← links)
- Graphs with large paired-domination number (Q867028) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- Paired-domination in generalized claw-free graphs (Q2460102) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- The diameter of paired-domination vertex critical graphs (Q3624924) (← links)