Judicious \(k\)-partitions of graphs
From MaRDI portal
Publication:1003836
DOI10.1016/j.jctb.2008.08.007zbMath1184.05099OpenAlexW2041509475MaRDI QIDQ1003836
Publication date: 4 March 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2008.08.007
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (22)
On judicious partitions of graphs ⋮ Judicious partitions of weighted hypergraphs ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ On several partitioning problems of Bollobás and Scott ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ 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 ⋮ Defective coloring of hypergraphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ A bound for judicious \(k\)-partitions of graphs ⋮ A note on balanced bipartitions ⋮ Simple probabilistic analysis to generalize bottleneck graph multi-partitioning ⋮ Balanced judicious bipartitions of graphs ⋮ Better Bounds for k-Partitions of Graphs ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Maximum bipartite subgraphs in graphs without short cycles
Cites Work
- On a bottleneck bipartition conjecture of Erdős
- Bipartite subgraphs of integer weighted graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Exact bounds for judicious partitions of graphs
- Bipartite subgraphs
- Problems and results on judicious partitions
- Some Extremal Properties of Bipartite Subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Judicious \(k\)-partitions of graphs