A note on balanced bipartitions
From MaRDI portal
Publication:709305
DOI10.1016/J.DISC.2010.03.029zbMATH Open1219.05147OpenAlexW1969017638MaRDI QIDQ709305FDOQ709305
Authors: Juan Yan, Xingxing Yu, Baogang Xu 
Publication date: 18 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.029
Recommendations
Cites Work
- Maximum matching and a polyhedron with 0,1-vertices
- Exact bounds for judicious partitions of graphs
- Judicious partitions and related problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Problems and results on judicious partitions
- Some Extremal Properties of Bipartite Subgraphs
- Judicious \(k\)-partitions of graphs
- Title not available (Why is that?)
- Balanced judicious bipartitions of graphs
- On a bottleneck bipartition conjecture of Erdős
- Judicious partitions of graphs
- Judicious partitions of bounded‐degree graphs
- Balanced judicious partitions of \((k,k-1)\)-biregular graphs
- On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
- Title not available (Why is that?)
Cited In (28)
- Maximum bisections of graphs without short even cycles
- On bisections of graphs without complete bipartite graphs
- Bounds for the number of meeting edges in graph partitioning.
- Upper bounds on minimum balanced bipartitions
- Maximum balanced 3-partitions of graphs
- Bisections of graphs without \(K_{2, l}\)
- On judicious bisections of graphs
- On judicious partitions of graphs
- Balanced judicious bipartitions of graphs
- Judicious partitions of weighted hypergraphs
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Graph partitioning: an updated survey
- Biased partitions and judicious \(k\)-partitions of graphs
- Bounds for judicious balanced bipartitions of graphs
- Balanced judicious partitions of graphs with \(\Delta(G)-\delta(G))\leqslant 2\)
- Maximum bisections of graphs without cycles of length 4
- Balanced judicious partitions of \((k,k-1)\)-biregular graphs
- Balanced coloring of bipartite graphs
- A note on almost balanced bipartitions of a graph
- Bisections of graphs without short cycles
- On minimum balanced bipartitions of triangle-free graphs
- Maximum bisections of graphs with girth at least six
- On bisections of directed graphs
- Maximum bisections of graphs without cycles of length four and five
- On problems about judicious bipartitions of graphs
- Bipartition of graph under degree constraints
- A note on judicious bisections of graphs
- On balanced bipartitions of graphs
This page was built for publication: A note on balanced bipartitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709305)
