The roman k-domatic number of a graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3970788 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Extremal problems for roman domination
- Hidden superconformal symmetry in M-theory
- Roman \(k\)-domination in graphs
- Roman domination in graphs.
- The \(k\)-domatic number of a graph
- The roman domatic number of a graph
Cited in
(10)- The distance Roman domatic number of a graph
- Computing Roman domatic number of graphs
- The roman domatic number of a graph
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Roman \(k\)-domination number upon vertex and edge removal
- The Roman domatic problem in graphs and digraphs: a survey
- A note on \(k\)-Roman graphs
- The Roman \((k, k)\)-domatic number of a graph
- The Roman \(\{2 \}\)-domatic number of graphs
- Roman \(k\)-domination in graphs
This page was built for publication: The roman \(k\)-domatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353534)