The following pages link to \((1, j)\)-set problem in graphs (Q294556):
Displaying 6 items.
- On \([j, k]\)-sets in graphs (Q2091155) (← links)
- \([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)
- 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)
