On the difference between broadcast and multipacking numbers of graphs
From MaRDI portal
Recommendations
Cited in
(13)- k-broadcast domination and k-multipacking
- On the complexity of broadcast domination and multipacking in digraphs
- Broadcasts on paths and cycles
- 2-limited broadcast domination in subcubic graphs
- Broadcast domination and multipacking in strongly chordal graphs
- Broadcast domination in graphs
- On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs
- Broadcast domination and multipacking: bounds and the integrality gap
- On the multipacking number of grid graphs
- Relation between broadcast domination and multipacking numbers on chordal graphs
- On the broadcast independence number of locally uniform 2-lobsters
- Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs
- Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
This page was built for publication: On the difference between broadcast and multipacking numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878206)