The following pages link to (Q3423990):
Displaying 22 items.
- Global defensive sets in graphs (Q279197) (← links)
- Global defensive alliances of trees and Cartesian product of paths and cycles (Q412345) (← links)
- Bounds on global secure sets in cactus trees (Q424125) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Parameterized complexity of locally minimal defensive alliances (Q831707) (← links)
- Global defensive \(k\)-alliances in graphs (Q1003661) (← links)
- Offensive \(r\)-alliances in graphs (Q1003773) (← links)
- On the complement graph and defensive \(k\)-alliances (Q1026126) (← links)
- Global defensive alliances in star graphs (Q1026159) (← links)
- Client-server and cost effective sets in graphs (Q1713579) (← links)
- A note on the global offensive alliances in graphs (Q1801085) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- Global defensive alliances in the lexicographic product of paths and cycles (Q2192075) (← links)
- Upper bounds on the global offensive alliances in graphs (Q2217469) (← links)
- Linear time algorithms for weighted offensive and powerful alliances in trees (Q2342667) (← links)
- Global edge alliances in graphs (Q2414475) (← links)
- On defensive alliances and strong global offensive alliances (Q2434727) (← links)
- Some bounds on global alliances in trees (Q2446301) (← links)
- Global offensive alliances in graphs and random graphs (Q2448887) (← links)
- Globally minimal defensive alliances (Q2671799) (← links)
- Algorithms and Complexity of Alliances in Graphs (Q3384123) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
