Minimum bisections of graphs without even cycles
From MaRDI portal
Cites work
- A note on balanced bipartitions
- Bipartite subgraphs of H-free graphs
- Bisections of graphs
- Bisections of graphs without \(K_{2, l}\)
- Bisections of graphs without short cycles
- Cycles of even length in graphs
- Explicit Concentrators from Generalized N-Gons
- Extremal combinatorics. With applications in computer science
- scientific article; zbMATH DE number 125467 (Why is no real title available?)
- scientific article; zbMATH DE number 1942408 (Why is no real title available?)
- Lower bounds for max-cut in H-free graphs via semidefinite programming
- Matchings in regular graphs from eigenvalues
- Max-bisections of \(H\)-free graphs
- MaxCut in ${\bm H)$-Free Graphs
- Maximum bipartite subgraphs in graphs without short cycles
- Maximum bisections of graphs without cycles of length 4
- Maximum bisections of graphs without short even cycles
- Maximum cuts and judicious partitions in graphs without short cycles
- Maximum cuts of graphs with forbidden cycles
- Minimum balanced bipartitions of planar triangulations
- New results for MaxCut in H$H$‐free graphs
- On bisections of graphs without complete bipartite graphs
- On MaxCut and the Lov\'asz theta function
- On min-bisections of graphs
- On minimum balanced bipartitions of triangle-free graphs
- On the Edge-Expansion of Graphs
- Polarities and \(2k\)-cycle-free graphs
- Positive discrepancy, MaxCut, and eigenvalues of graphs
- Problems and results on judicious partitions
- Some simplified NP-complete graph problems
- The bisection width of cubic graphs
- The nonexistence of certain generalized polygons
- Upper bounds on minimum balanced bipartitions
- Upper bounds on the bisection width of 3- and 4-regular graphs
This page was built for publication: Minimum bisections of graphs without even cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884395)
