Pages that link to "Item:Q5155707"
From MaRDI portal
The following pages link to Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs (Q5155707):
Displaying 11 items.
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Broadcast domination in subcubic graphs (Q2093109) (← links)
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles (Q2112664) (← links)
- 2-limited broadcast domination in subcubic graphs (Q2197488) (← links)
- Broadcast Domination in Graphs (Q3384108) (← links)
- (Q4622603) (← links)
- Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids (Q5235437) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897555) (← links)
- 2-limited broadcast domination on grid graphs (Q6110604) (← links)
- Proving exact values for the \(2\)-limited broadcast domination number on grid graphs (Q6599802) (← links)