Exact bounds for judicious partitions of graphs
From MaRDI portal
Publication:1977429
DOI10.1007/s004939970002zbMath0985.05028OpenAlexW2082198405MaRDI QIDQ1977429
Béla Bollobás, Alexander D. Scott
Publication date: 14 May 2000
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004939970002
Related Items (45)
On judicious partitions of uniform hypergraphs ⋮ On judicious partitions of graphs ⋮ Judicious partitions of weighted hypergraphs ⋮ Problems and results on judicious partitions ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ On judicious bipartitions of directed graphs ⋮ Judicious partitions of directed graphs ⋮ On several partitioning problems of Bollobás and Scott ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ On bisections of graphs without complete bipartite graphs ⋮ On judicious bisections of graphs ⋮ Upper bounds on minimum balanced bipartitions ⋮ Graph partitioning: an updated survey ⋮ On a bipartition problem of Bollobás and Scott ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ Partitions of graphs with high minimum degree or connectivity. ⋮ Bisections of Graphs Without Short Cycles ⋮ Optimal bisections of directed graphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Bisections of graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ A bound for judicious \(k\)-partitions of graphs ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Judicious partitions of uniform hypergraphs ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ Bounds for judicious balanced bipartitions of graphs ⋮ On bipartitions of directed graphs with small semidegree ⋮ A note on balanced bipartitions ⋮ Bounds for pairs in partitions of graphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ Balanced judicious bipartitions of graphs ⋮ On judicious bipartitions of graphs ⋮ Bipartitions of oriented graphs ⋮ Better Bounds for k-Partitions of Graphs ⋮ Judicious \(k\)-partitions of graphs ⋮ On partitions of \(K_{2, 3}\)-free graphs under degree constraints ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Judicious partitions of bounded‐degree graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ On problems about judicious bipartitions of graphs
This page was built for publication: Exact bounds for judicious partitions of graphs
