Pages that link to "Item:Q1977429"
From MaRDI portal
The following pages link to Exact bounds for judicious partitions of graphs (Q1977429):
Displaying 48 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- 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)
- Bisections of graphs (Q461728) (← links)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- Judicious partitions of uniform hypergraphs (Q484549) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Bounds for pairs in partitions of graphs (Q982612) (← links)
- Max \(k\)-cut and judicious \(k\)-partitions (Q982619) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Judicious partitions of graphs (Q1314903) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Partitions of graphs with high minimum degree or connectivity. (Q1405098) (← links)
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- Bounds for judicious balanced bipartitions of graphs (Q1756085) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← 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)
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs (Q2454588) (← 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)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← 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)
- Problems and results on judicious partitions (Q4798176) (← links)
- On Bounds for the k-Partitioning of Graphs (Q4938663) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced judicious bipartitions of graphs (Q5190331) (← links)
- Better Bounds for <i>k</i>-Partitions of Graphs (Q5199512) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 (Q5366944) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
- A note on judicious bisections of graphs (Q6666591) (← links)
