Biased partitions and judicious \(k\)-partitions of graphs

DOI10.1007/s10114-016-6043-9zbMath1362.05108OpenAlexW2565260508MaRDI QIDQ2627880

Jin Deng, Xia Lei, Qinghou Zeng, Jian-Feng Hou

Publication date: 1 June 2017

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-016-6043-9

zbMATH Keywords

judicious partitionmax-cutbiased partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Graph partitioning: an updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On judicious partitions of uniform hypergraphs
• On judicious partitions of graphs
• On judicious bisections of graphs
• A bound for judicious \(k\)-partitions of graphs
• On several partitioning problems of Bollobás and Scott
• A note on balanced bipartitions
• Max \(k\)-cut and judicious \(k\)-partitions
• Judicious \(k\)-partitions of graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Exact bounds for judicious partitions of graphs
• Bounds for pairs in judicious partitioning of graphs
• Problems and results on judicious partitions
• On a Problem of Judiciousk-Partitions of Graphs
• Balanced judicious bipartitions of graphs
• Better Bounds for k-Partitions of Graphs
• Bounds for the number of meeting edges in graph partitioning
• Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
• Node-and edge-deletion NP-complete problems
• Some Extremal Properties of Bipartite Subgraphs
• On judicious bipartitions of graphs