Balanced judicious bipartitions of graphs
From MaRDI portal
Publication:5190331
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?)
- Balanced judicious partitions of \((k,k-1)\)-biregular graphs
- Exact bounds for judicious partitions of graphs
- Judicious \(k\)-partitions of graphs
- On a bottleneck bipartition conjecture of Erdős
- Some Extremal Properties of Bipartite Subgraphs
Cited in
(41)- Some results of regular graphs on the existence of balanced partition
- Balanced judicious bipartition is fixed-parameter tractable
- A note on almost balanced bipartitions of a graph
- On judicious bisections of graphs
- On balanced bipartitions of graphs
- Bipartition of graph under degree constraints
- On bisections of graphs without complete bipartite graphs
- Linear balanceable and subcubic balanceable graphs
- Judicious bisection of hypergraphs
- On bisections of directed graphs
- Weak external bisections of regular graphs
- Bisections of graphs without short cycles
- Extremal bipartite independence number and balanced coloring
- Judicious partitions of weighted hypergraphs
- Perfectly balanced partitions of smoothed graphs
- A note on balanced bipartitions
- Upper bounds on minimum balanced bipartitions
- Regular spanning subgraphs of bipartite graphs of high minimum degree
- scientific article; zbMATH DE number 6311292 (Why is no real title available?)
- 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
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
- Bipartitions of oriented graphs
- Maximum balanced 3-partitions of graphs
- On problems about judicious bipartitions of graphs
- Implicit degree in balanced bipartite graphs
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Balanced graphs with minimum degree constraints
- Bisections of graphs without \(K_{2, l}\)
- Graph partitioning: an updated survey
- A degree sequence variant of balanced bipartition problem of graphs.
- On minimum balanced bipartitions of triangle-free graphs
- On locally-balanced 2-partitions of bipartite graphs
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Biased partitions and judicious \(k\)-partitions of graphs
- Bounds for judicious balanced bipartitions of graphs
- Minimum balanced bipartitions of planar triangulations
- A note on judicious bisections of graphs
- On judicious bipartitions of directed graphs
- scientific article; zbMATH DE number 4053680 (Why is no real title available?)
This page was built for publication: Balanced judicious bipartitions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5190331)
