The following pages link to Double Roman domination (Q335328):
Displaying 10 items.
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Further results on the \([k]\)-Roman domination in graphs (Q6563288) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- On the total restrained double Italian domination (Q6585921) (← links)
- Solving the minimum-cost double Roman domination problem (Q6608515) (← links)
- Weak double Roman domination (Q6639835) (← links)
- Quasi total double Roman domination in graphs (Q6643350) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
- Domination parameters of generalized Sierpiński graphs (Q6651148) (← links)
