Pages that link to "Item:Q2045048"
From MaRDI portal
The following pages link to Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048):
Displaying 4 items.
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
- A characterization relating domination, semitotal domination and total Roman domination in trees (Q4957559) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)