On judicious bipartitions of graphs

DOI10.1007/s00493-015-2944-yzbMath1399.05127OpenAlexW2252762257MaRDI QIDQ5915867

Xingxing Yu, Jie Ma

Publication date: 22 February 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-015-2944-y

zbMATH Keywords

bipartite subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (12)

Biased partitions and judicious \(k\)-partitions of graphs ⋮ On judicious bipartitions of directed graphs ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Partitioning dense uniform hypergraphs ⋮ Optimal bisections of directed graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ On bipartitions of directed graphs with small semidegree ⋮ Bipartitions of oriented graphs ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ On problems about judicious bipartitions of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Max \(k\)-cut and judicious \(k\)-partitions
• Judicious partitions of graphs
• 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
• Improved approximation of Max-Cut on graphs of bounded degree
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Judicious partitions of bounded‐degree graphs
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Node-and edge-deletion NP-complete problems
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: On judicious bipartitions of graphs