Pages that link to "Item:Q642968"
From MaRDI portal
The following pages link to A note on total reinforcement in graphs (Q642968):
Displaying 9 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- On the complexity of reinforcement in graphs (Q339476) (← 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)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- The average lower reinforcement number of a graph (Q2953689) (← links)
- (Q5284099) (← links)