Pages that link to "Item:Q1003729"
From MaRDI portal
The following pages link to Efficient algorithms for Roman domination on some classes of graphs (Q1003729):
Displaying 34 items.
- Computing Roman domatic number of graphs (Q284340) (← links)
- Roman domination in subgraphs of grids (Q324726) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Weak \(\{2\}\)-domination number of Cartesian products of cycles (Q1698059) (← links)
- A continuous generalization of domination-like invariants (Q2045030) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- Restrained condition on double Roman dominating functions (Q2096308) (← links)
- A note on the bounds of Roman domination numbers (Q2144876) (← links)
- Total Roman \(\{2\}\)-dominating functions in graphs (Q2151223) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
- Maximal double Roman domination in graphs (Q2247105) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Roman domination dot-critical graphs (Q2376108) (← links)
- Vertex-addition strategy for domination-like invariants (Q2401431) (← links)
- On the signed Roman \(k\)-domination: complexity and thin torus graphs (Q2410261) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- Roman domination in graphs: The class ℛUV R (Q2821115) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH (Q4928332) (← links)
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS (Q4956471) (← links)
- A note on the Roman domatic number of a digraph (Q5212896) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Quadruple Roman domination in graphs (Q5866033) (← links)
- On the outer independent total double Roman domination in graphs (Q6042155) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Complexity aspects of restrained Roman domination in graphs (Q6132244) (← links)
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs (Q6158956) (← links)
- Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
