Pages that link to "Item:Q5236035"
From MaRDI portal
The following pages link to Partitioning the Vertices of a Graph into Two Total Dominating Sets (Q5236035):
Displaying 7 items.
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Spanning trees with disjoint dominating and 2-dominating sets (Q2062688) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Partitioning a graph into two pieces, each isomorphic to the other or to its complement (Q2576840) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- Partitioning a graph into a dominating set, a total dominating set, and something else (Q2997583) (← links)
- A characterization of graphs with disjoint total dominating sets (Q5225045) (← links)