Pages that link to "Item:Q6132244"
From MaRDI portal
The following pages link to Complexity aspects of restrained Roman domination in graphs (Q6132244):
Displaying 4 items.
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- Some progress on the restrained Roman domination (Q2021658) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)