On bisections of graphs without complete bipartite graphs
From MaRDI portal
Publication:6056762
DOI10.1002/jgt.22717zbMath1522.05378OpenAlexW3191180382MaRDI QIDQ6056762
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22717
Related Items (4)
Maximum bisections of graphs without cycles of length 4 ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Graph partitioning: an updated survey ⋮ Optimal bisections of directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On judicious bisections of graphs
- Bisections of graphs
- A bound for judicious \(k\)-partitions of graphs
- On several partitioning problems of Bollobás and Scott
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- A note on balanced bipartitions
- On tight components and anti-tight components
- Bounds for pairs in partitions of graphs
- Judicious partitions of hypergraphs
- Bisections of graphs without \(K_{2, l}\)
- Exact bounds for judicious partitions of graphs
- Max-bisections of \(H\)-free graphs
- Bipartite subgraphs
- Bounds for pairs in judicious partitioning of graphs
- Judicious partitions of directed graphs
- Judicious partitions of bounded‐degree graphs
- Bisections of Graphs Without Short Cycles
- Problems and results on judicious partitions
- Balanced judicious bipartitions of graphs
- The RPR2 rounding technique for semidefinite programs
- Some Extremal Properties of Bipartite Subgraphs
- Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
This page was built for publication: On bisections of graphs without complete bipartite graphs
