The following pages link to Partitioning 3-uniform hypergraphs (Q765201):
Displaying 11 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- Bisections of graphs (Q461728) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- Judicious partitions of directed graphs (Q3467583) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- Judiciously 3‐partitioning 3‐uniform hypergraphs (Q5128756) (← links)
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 (Q5366944) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
