The following pages link to (Q3211331):
Displaying 17 items.
- Very cost effective bipartitions in graphs (Q322000) (← links)
- 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)
- Linear time algorithms for weighted offensive and powerful alliances in trees (Q2342667) (← links)
- Security in graphs (Q2381534) (← links)
- Majority choosability of digraphs (Q2409821) (← links)
- Bounds on a graph's security number (Q2476256) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- Stabilization Time in Weighted Minority Processes (Q5090505) (← links)
- Bounds on cost effective domination numbers (Q5236029) (← links)
- Every rayless graph has an unfriendly partition (Q5891221) (← links)
- Friendly bisections of random graphs (Q6052387) (← links)
- Majority choosability of countable graphs (Q6181996) (← links)
- Majority coloring of infinite digraphs (Q6621148) (← links)
- Partitioning problems via random processes (Q6658754) (← links)
