Broadcast domination in subcubic graphs
From MaRDI portal
Publication:2093109
DOI10.1007/s00373-022-02592-xzbMath1502.05196OpenAlexW4307649780MaRDI QIDQ2093109
Publication date: 4 November 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02592-x
Cites Work
- Independent domination in subcubic bipartite graphs of girth at least six
- Optimal broadcast domination in polynomial time
- Radial trees
- \(k\)-broadcast domination and \(k\)-multipacking
- New bounds for the broadcast domination number of a graph
- Independent domination in bipartite cubic graphs
- Broadcasts on paths and cycles
- 2-limited broadcast domination in subcubic graphs
- Independent domination in subcubic graphs of girth at least six
- Broadcast domination and multipacking in strongly chordal graphs
- On domination in connected cubic graphs
- Broadcasts in graphs
- Broadcast Domination on Block Graphs in Linear Time
- Independent Domination in Cubic Graphs
- General bounds on limited broadcast domination
- Paths, Stars and the Number Three
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- A linear‐time algorithm for broadcast domination in a tree
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Broadcast domination in subcubic graphs