The following pages link to (Q3211331):
Displayed 6 items.
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- On a graph's security number (Q1043972) (← links)
- Security in graphs (Q2381534) (← links)
- Bounds on a graph's security number (Q2476256) (← links)
- Every rayless graph has an unfriendly partition (Q5891221) (← links)