Relation between broadcast domination and multipacking numbers on chordal graphs
From MaRDI portal
Publication:6132545
DOI10.1007/978-3-031-25211-2_23OpenAlexW4318023112MaRDI QIDQ6132545FDOQ6132545
Florent Foucaud, Sandip Das, Sk Samim Islam, Joydeep Mukherjee
Publication date: 17 August 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_23
Cites Work
- Combinatorial optimization. Packing and covering
- Relations between packing and covering numbers of a tree
- Broadcasts in graphs
- Title not available (Why is that?)
- Optimal broadcast domination in polynomial time
- New bounds for the broadcast domination number of a graph
- Title not available (Why is that?)
- On the multipacking number of grid graphs
- On powers and centers of chordal graphs
- On the complexity of broadcast domination and multipacking In digraphs
- On the difference between broadcast and multipacking numbers of graphs
- Broadcast domination and multipacking in strongly chordal graphs
- Broadcast domination and multipacking: bounds and the integrality gap
This page was built for publication: Relation between broadcast domination and multipacking numbers on chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132545)