Recommendations
Cited in
(28)- Domination parameters with number 2: interrelations and algorithmic consequences
- Perfect Italian domination in trees
- Difference between 2-rainbow domination and roman domination in graphs
- A continuous generalization of domination-like invariants
- Graphs with large Italian domination number
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs
- Total Roman reinforcement in graphs
- Vertex-addition strategy for domination-like invariants
- Exact algorithms for weak Roman domination
- Total Roman domination in the lexicographic product of graphs
- On 2-rainbow domination and roman domination in graphs
- Roman domination in graphs
- The Roman domination number of some special classes of graphs - convex polytopes
- Edge Roman domination on graphs
- Roman domination on strongly chordal graphs
- Independent Roman domination and 2-independence in trees
- Mixed Roman domination and 2-independence in trees
- Global double Roman domination in graphs
- Italian domination in trees
- Minimal Roman dominating functions: extensions and enumeration
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
- Minimal Roman dominating functions: extensions and enumeration
- The k-th Roman domination problem is polynomial on interval graphs
- The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes
- Title not available (Why is no real title available?)
- Upper bounds on Roman domination numbers of graphs
- Perfect double Roman domination of trees
- Data reductions and combinatorial bounds for improved approximation algorithms
This page was built for publication: Roman domination on 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902897)
