Max-bisections in the network graphs
From MaRDI portal
Cites work
- A note on balanced bipartitions
- Bipartite subgraphs
- Bipartite subgraphs of integer weighted graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- Bisections of graphs
- Bisections of graphs without \(K_{2, l}\)
- Bisections of graphs without short cycles
- scientific article; zbMATH DE number 3510345 (Why is no real title available?)
- Hypergraph cuts above the average
- Judicious partitions and related problems
- Max \(k\)-cut and judicious \(k\)-partitions
- Max-bisections of \(H\)-free graphs
- Maximum bipartite subgraphs in graphs without short cycles
- Maximum bisections of graphs without short even cycles
- New results for MaxCut in H$H$‐free graphs
- On bisections of graphs without complete bipartite graphs
- On judicious bisections of graphs
- On problems about judicious bipartitions of graphs
- On several partitioning problems of Bollobás and Scott
- Problems and results on judicious partitions
- Some Extremal Properties of Bipartite Subgraphs
- The size of the largest bipartite subgraphs
This page was built for publication: Max-bisections in the network graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446357)