Pages that link to "Item:Q2299982"
From MaRDI portal
The following pages link to Disjoint dominating and 2-dominating sets in graphs (Q2299982):
Displaying 9 items.
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Spanning trees with disjoint dominating and 2-dominating sets (Q2062688) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- On graphs with disjoint dominating and 2-dominating sets (Q2866456) (← links)
- (Q3615799) (← links)
- Graphs with disjoint 2-dominating sets (Q5863482) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6611090) (← links)