Pages that link to "Item:Q2030435"
From MaRDI portal
The following pages link to Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435):
Displaying 18 items.
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- Spanning trees with disjoint dominating and 2-dominating sets (Q2062688) (← links)
- Domination versus total domination in claw-free cubic graphs (Q2075530) (← links)
- Upper total domination in claw-free cubic graphs (Q2084795) (← links)
- Triangles and (total) domination in subcubic graphs (Q2115140) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- Semipaired domination in claw-free cubic graphs (Q2413648) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- Partitioning claw-free subcubic graphs into two dominating sets (Q2657047) (← links)
- Partitioning a graph into a dominating set, a total dominating set, and something else (Q2997583) (← links)
- Acyclic total dominating sets in cubic graphs (Q5028796) (← links)
- A characterization of graphs with disjoint total dominating sets (Q5225045) (← links)
- Maker-Breaker total domination game on cubic graphs (Q6045416) (← links)
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237) (← links)
- The zero forcing number of claw-free cubic graphs (Q6633547) (← links)