k-broadcast domination and k-multipacking
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6843211 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- Broadcasts in graphs
- On the difference between broadcast and multipacking numbers of graphs
- Optimal broadcast domination in polynomial time
- Radial trees
- Total domination in graphs
Cited in
(9)- Broadcast domination in subcubic graphs
- On the difference between broadcast and multipacking numbers of graphs
- Broadcast domination in graphs
- On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs
- On the complexity of broadcast domination and multipacking in digraphs
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- Broadcast domination and multipacking: bounds and the integrality gap
- 2-limited broadcast domination in subcubic graphs
- On the multipacking number of grid graphs
This page was built for publication: \(k\)-broadcast domination and \(k\)-multipacking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801065)