Recommendations
Cites work
- scientific article; zbMATH DE number 4137791 (Why is no real title available?)
- scientific article; zbMATH DE number 3510345 (Why is no real title available?)
- scientific article; zbMATH DE number 637304 (Why is no real title available?)
- scientific article; zbMATH DE number 1787231 (Why is no real title available?)
- Balanced judicious bipartitions of graphs
- Balanced judicious partitions of \((k,k-1)\)-biregular graphs
- Exact bounds for judicious partitions of graphs
- Judicious \(k\)-partitions of graphs
- Judicious partitions and related problems
- Judicious partitions of bounded‐degree graphs
- Judicious partitions of graphs
- Maximum matching and a polyhedron with 0,1-vertices
- On a bottleneck bipartition conjecture of Erdős
- On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
- Problems and results on judicious partitions
- Some Extremal Properties of Bipartite Subgraphs
Cited in
(28)- Bounds for the number of meeting edges in graph partitioning.
- A note on almost balanced bipartitions of a graph
- On judicious bisections of graphs
- Maximum bisections of graphs without cycles of length 4
- On balanced bipartitions of graphs
- Bipartition of graph under degree constraints
- On bisections of graphs without complete bipartite graphs
- On judicious partitions of graphs
- On bisections of directed graphs
- Bisections of graphs without short cycles
- Judicious partitions of weighted hypergraphs
- Maximum bisections of graphs without cycles of length four and five
- Upper bounds on minimum balanced bipartitions
- Balanced judicious partitions of graphs with \(\Delta(G)-\delta(G))\leqslant 2\)
- Balanced judicious partitions of \((k,k-1)\)-biregular graphs
- Balanced coloring of bipartite graphs
- Maximum bisections of graphs without short even cycles
- Maximum bisections of graphs with girth at least six
- Maximum balanced 3-partitions of graphs
- On problems about judicious bipartitions of graphs
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Bisections of graphs without \(K_{2, l}\)
- Graph partitioning: an updated survey
- Balanced judicious bipartitions of graphs
- On minimum balanced bipartitions of triangle-free graphs
- Biased partitions and judicious \(k\)-partitions of graphs
- Bounds for judicious balanced bipartitions of graphs
- A note on judicious bisections 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)
