The following pages link to Reinforcement numbers of digraphs (Q1026162):
Displaying 8 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- Trees with maximum \(p\)-reinforcement number (Q401133) (← links)
- On the complexity of the bondage and reinforcement problems (Q413470) (← links)
- On the \(p\)-reinforcement and the complexity (Q2253958) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- The average lower reinforcement number of a graph (Q2953689) (← links)
- Rainbow reinforcement numbers in digraphs (Q2979763) (← links)
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems (Q5377042) (← links)
