Pages that link to "Item:Q2292130"
From MaRDI portal
The following pages link to Algorithmic results on double Roman domination in graphs (Q2292130):
Displaying 10 items.
- Algorithm and hardness results in double Roman domination of graphs (Q2118874) (← links)
- Double Roman domination in generalized Petersen graphs (Q2151479) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- (Q6149323) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Solving the minimum-cost double Roman domination problem (Q6608515) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
