Pages that link to "Item:Q2997583"
From MaRDI portal
The following pages link to Partitioning a graph into a dominating set, a total dominating set, and something else (Q2997583):
Displaying 11 items.
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- (Q4980977) (← links)
- Graphs with disjoint 2-dominating sets (Q5863482) (← links)
- A unified greedy approximation for several dominating set problems (Q6093579) (← 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)