On min-bisections of graphs
From MaRDI portal
Cites work
- A note on balanced bipartitions
- Balanced judicious bipartitions of graphs
- Bisections of graphs
- Bisections of graphs without \(K_{2, l}\)
- Bisections of graphs without short cycles
- Cycles of even length in graphs
- Decomposing C₄-free graphs under degree constraints
- Exact bounds for judicious partitions of graphs
- Expander flows, geometric embeddings and graph partitioning
- Extremal combinatorics. With applications in computer science
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Judicious partitions of bounded‐degree graphs
- Max-bisections of \(H\)-free graphs
- MaxCut in ${\bm H)$-Free Graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Minimum balanced bipartitions of planar triangulations
- On judicious bipartitions of graphs
- On judicious bisections of graphs
- On minimum balanced bipartitions of triangle-free graphs
- On problems about judicious bipartitions of graphs
- On several partitioning problems of Bollobás and Scott
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
- Probability Inequalities for Sums of Bounded Random Variables
- Problems and results on judicious partitions
- Recent directions in netlist partitioning: a survey
- Triangle-free subcubic graphs with minimum bipartite density
- Upper bounds on minimum balanced bipartitions
- Weighted sums of certain dependent random variables
This page was built for publication: On min-bisections of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913319)
