The following pages link to Unfriendly partitions of a graph (Q753841):
Displaying 20 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)
- Judicious partitions of graphs (Q1314903) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- Unfriendly partitions for graphs not containing a subdivison of an infinite cycle (Q1705811) (← 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)
- Majority edge-colorings of graphs (Q2692181) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- Game $k$-Domination Number of Graphs (Q5029314) (← links)
- Stabilization Time in Weighted Minority Processes (Q5090505) (← links)
- Friendly bisections of random graphs (Q6052387) (← links)
- Majority choosability of countable graphs (Q6181996) (← links)
- A note on median eigenvalues of subcubic graphs (Q6184318) (← links)
