Pages that link to "Item:Q602718"
From MaRDI portal
The following pages link to On several partitioning problems of Bollobás and Scott (Q602718):
Displaying 25 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- Judicious bisection of hypergraphs (Q287970) (← links)
- Judicious partitions of weighted hypergraphs (Q295108) (← links)
- Bisections of graphs (Q461728) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Partitioning 3-uniform hypergraphs (Q765201) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- On judicious partitions of hypergraphs with edges of size at most 3 (Q2349971) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Judicious partitions of directed graphs (Q3467583) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 (Q5366944) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
