The following pages link to (Q4405794):
Displayed 22 items.
- Very cost effective bipartitions in graphs (Q322000) (← links)
- Global defensive alliances of trees and Cartesian product of paths and cycles (Q412345) (← links)
- Partitioning a graph into defensive \(k\)-alliances (Q546272) (← links)
- Partitioning a graph into offensive \(k\)-alliances (Q629362) (← links)
- Min-max communities in graphs: complexity and computational properties (Q899313) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Global defensive \(k\)-alliances in graphs (Q1003661) (← links)
- Powerful alliances in graphs (Q1025468) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- On the complement graph and defensive \(k\)-alliances (Q1026126) (← links)
- Defensive \(k\)-alliances in graphs (Q1027474) (← links)
- On a graph's security number (Q1043972) (← links)
- On some open problems concerning quorum colorings of graphs (Q1671350) (← links)
- Weak internal partition of regular graphs (Q1690616) (← links)
- Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
- Partitioning a graph into global powerful \(k\)-alliances (Q1926038) (← links)
- Saturated boundary \(k\)-alliances in graphs (Q2341725) (← links)
- Security in graphs (Q2381534) (← links)
- Alliance free sets in Cartesian product graphs (Q2446344) (← links)
- Bounds on a graph's security number (Q2476256) (← links)
- The satisfactory partition problem (Q2495904) (← links)
- Internal Partitions of Regular Graphs (Q2825476) (← links)