The following pages link to (Q5488895):
Displaying 16 items.
- Global strong defensive alliances of Sierpiński-like graphs (Q372953) (← links)
- Partitioning a graph into defensive \(k\)-alliances (Q546272) (← links)
- Boundary defensive \(k\)-alliances in graphs (Q708358) (← links)
- Global defensive \(k\)-alliances in graphs (Q1003661) (← links)
- Offensive \(r\)-alliances in graphs (Q1003773) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- Defensive \(k\)-alliances in graphs (Q1027474) (← links)
- Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
- Client-server and cost effective sets in graphs (Q1713579) (← links)
- Partitioning a graph into global powerful \(k\)-alliances (Q1926038) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- Global defensive alliances in the lexicographic product of paths and cycles (Q2192075) (← links)
- Saturated boundary \(k\)-alliances in graphs (Q2341725) (← links)
- Alliance free and alliance cover sets (Q2430310) (← links)
- Alliance free sets in Cartesian product graphs (Q2446344) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
