On a Problem of Judiciousk-Partitions of Graphs

DOI10.1002/jgt.22094zbMath1367.05168OpenAlexW2550065169MaRDI QIDQ4978292

Qinghou Zeng, Jian-Feng Hou

Publication date: 8 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22094

zbMATH Keywords

judicious partitionmax-cut

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Biased partitions and judicious \(k\)-partitions of graphs ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Maximum bisections of graphs without short even cycles

Cites Work

• Unnamed Item
• Unnamed Item
• On judicious partitions of uniform hypergraphs
• On judicious bisections of graphs
• Bisections of graphs
• A bound for judicious \(k\)-partitions of graphs
• Judicious partitions of uniform hypergraphs
• On several partitioning problems of Bollobás and Scott
• Max \(k\)-cut and judicious \(k\)-partitions
• Judicious \(k\)-partitions of graphs
• Bipartite density of triangle-free subcubic graphs
• On a bottleneck bipartition conjecture of Erdős
• Maximum cuts and judicious partitions in graphs without short cycles
• Exact bounds for judicious partitions of graphs
• Triangle-free subcubic graphs with minimum bipartite density
• Bipartite subgraphs
• Maximumk-colorable subgraphs
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
• Some Extremal Properties of Bipartite Subgraphs
• On judicious bipartitions of graphs

This page was built for publication: On a Problem of Judiciousk-Partitions of Graphs