Pages that link to "Item:Q2902897"
From MaRDI portal
The following pages link to Roman domination on 2-connected graphs (Q2902897):
Displaying 26 items.
- Edge Roman domination on graphs (Q343714) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Italian domination in trees (Q516889) (← links)
- Upper bounds on Roman domination numbers of graphs (Q764908) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- Difference between 2-rainbow domination and roman domination in graphs (Q1946223) (← links)
- A continuous generalization of domination-like invariants (Q2045030) (← links)
- Graphs with large Italian domination number (Q2210211) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- Vertex-addition strategy for domination-like invariants (Q2401431) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- On 2-rainbow domination and roman domination in graphs (Q2848725) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- Independent Roman domination and 2-independence in trees (Q4577859) (← links)
- Mixed Roman domination and 2-independence in trees (Q4583517) (← links)
- Global double Roman domination in graphs (Q5030493) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) (Q6162014) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)