Pages that link to "Item:Q2253958"
From MaRDI portal
The following pages link to On the \(p\)-reinforcement and the complexity (Q2253958):
Displaying 6 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)
- The average lower reinforcement number of a graph (Q2953689) (← links)
- On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems (Q5377042) (← links)