Pages that link to "Item:Q5225045"
From MaRDI portal
The following pages link to A characterization of graphs with disjoint total dominating sets (Q5225045):
Displaying 10 items.
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- A characterization of graphs with disjoint dominating and paired-dominating sets (Q719018) (← links)
- Self-stabilizing algorithm for two disjoint minimal dominating sets (Q2414045) (← links)
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets (Q2570105) (← links)
- A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set (Q2869469) (← links)
- (Q3615799) (← links)
- Graphs with disjoint 2-dominating sets (Q5863482) (← links)
- Disjoint total dominating sets in near‐triangulations (Q6142659) (← links)
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237) (← links)
- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6611090) (← links)