On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
From MaRDI portal
Publication:5377042
zbMath1411.05203arXiv1802.00649MaRDI QIDQ5377042
Majid Hashemipour, Ali Shakiba, Mohammad Reza Hooshmandasl
Publication date: 23 May 2019
Full work available at URL: https://arxiv.org/abs/1802.00649
Related Items (2)
Complexity and bounds for disjunctive total bondage ⋮ On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of reinforcement in graphs
- On the outer-connected domination in graphs
- On the complexity of the bondage and reinforcement problems
- Restrained bondage in graphs
- Reinforcement numbers of digraphs
- The bondage number of a graph
- On bondage numbers of graphs: a survey with some comments
- On the \(p\)-reinforcement and the complexity
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
This page was built for publication: On the complexity of the outer-connected bondage and the outer-connected reinforcement problems