Better Bounds for k-Partitions of Graphs
From MaRDI portal
Publication:5199512
DOI10.1017/S0963548311000204zbMath1223.05245MaRDI QIDQ5199512
Publication date: 16 August 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (24)
On judicious partitions of graphs ⋮ Judicious partitions of weighted hypergraphs ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ On judicious bipartitions of directed graphs ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ On judicious bisections of graphs ⋮ Upper bounds on minimum balanced bipartitions ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Partitioning dense uniform hypergraphs ⋮ Optimal bisections of directed graphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Maximum cuts of graphs with forbidden cycles ⋮ A bound for judicious \(k\)-partitions of graphs ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Bounds for judicious balanced bipartitions of graphs ⋮ On bipartitions of directed graphs with small semidegree ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ On judicious bipartitions of graphs ⋮ Bipartitions of oriented graphs ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ On problems about judicious bipartitions of graphs
Cites Work
This page was built for publication: Better Bounds for k-Partitions of Graphs
