Pages that link to "Item:Q5199512"
From MaRDI portal
The following pages link to Better Bounds for <i>k</i>-Partitions of Graphs (Q5199512):
Displaying 23 items.
- On judicious partitions of graphs (Q281768) (← links)
- Judicious partitions of weighted hypergraphs (Q295108) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- Bounds for judicious balanced bipartitions of graphs (Q1756085) (← 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)
- On problems about judicious bipartitions of graphs (Q2338639) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
