Pages that link to "Item:Q897596"
From MaRDI portal
The following pages link to \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596):
Displayed 7 items.
- \([1,k]\)-domination number of lexicographic products of graphs (Q2227955) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- An explicit construction of optimal dominating and [1, 2]–dominating sets in grid (Q4956183) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices (Q5106724) (← links)
- Efficient interprocedural data-flow analysis using treedepth and treewidth (Q6174398) (← links)