The following pages link to (Q5284099):
Displaying 24 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- Total restrained reinforcement in graphs (Q322041) (← 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)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- A note on total reinforcement in graphs (Q642968) (← links)
- On the bondage, strong and weak bondage numbers in complementary prism graphs (Q821325) (← links)
- Reinforcement numbers of digraphs (Q1026162) (← links)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
- On the \(p\)-reinforcement and the complexity (Q2253958) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- On domination and reinforcement numbers in trees (Q2469996) (← links)
- Complexity and bounds for disjunctive total bondage (Q2661777) (← links)
- The average lower reinforcement number of a graph (Q2953689) (← links)
- Total Roman domination subdivision number in graphs (Q4957524) (← links)
- Secure domination subdivision number of a graph (Q4968284) (← links)
- The restrained k-rainbow reinforcement number of graphs (Q5013473) (← links)
- Restrained reinforcement number in graphs (Q5044530) (← links)
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems (Q5377042) (← links)
- Double Roman reinforcement number in graphs (Q5861712) (← links)
- Restrained k-rainbow reinforcement number in graphs (Q5876873) (← links)
- RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS (Q5884738) (← links)
- Quasi-total Roman reinforcement in graphs (Q6110872) (← links)
