Pages that link to "Item:Q4956233"
From MaRDI portal
The following pages link to Complexity of Roman {2}-domination and the double Roman domination in graphs (Q4956233):
Displaying 10 items.
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- On the watching number of graphs using discharging procedure (Q2143854) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- (Q6149323) (← links)
- Metaheuristic algorithms for solving Roman \(\{2\}\)-domination problem (Q6550850) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Solving the minimum-cost double Roman domination problem (Q6608515) (← links)