The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \(k\)-th Roman domination problem is polynomial on interval graphs |
scientific article; zbMATH DE number 7952405
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(k\)-th Roman domination problem is polynomial on interval graphs |
scientific article; zbMATH DE number 7952405 |
Statements
The \(k\)-th Roman domination problem is polynomial on interval graphs (English)
0 references
3 December 2024
0 references
domination
0 references
Roman domination
0 references
\(k\)-th Roman domination
0 references
polynomial time algorithm
0 references
interval graphs
0 references
