scientific article; zbMATH DE number 3510345
From MaRDI portal
Publication:4090369
zbMath0326.05115MaRDI QIDQ4090369
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (56)
On judicious partitions of uniform hypergraphs ⋮ The Crossing Number of the Cone of a Graph ⋮ Judicious partitions of weighted hypergraphs ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ On judicious bipartitions of directed graphs ⋮ Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Judicious partitions of hypergraphs ⋮ On several partitioning problems of Bollobás and Scott ⋮ Bipartite subgraphs of integer weighted graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ On bisections of graphs without complete bipartite graphs ⋮ On judicious bisections of graphs ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Upper bounds on minimum balanced bipartitions ⋮ Graph partitioning: an updated survey ⋮ On a bipartition problem of Bollobás and Scott ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ New results for MaxCut in H$H$‐free graphs ⋮ The Crossing Number of the Cone of a Graph ⋮ Bisections of Graphs Without Short Cycles ⋮ Optimal bisections of directed graphs ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Bisections of graphs ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound ⋮ Lovász, Vectors, Graphs and Codes ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ \textsc{Max-Cut} parameterized above the Edwards-Erdős bound ⋮ Parameterized Traveling Salesman Problem: Beating the Average ⋮ On bipartitions of directed graphs with small semidegree ⋮ A note on balanced bipartitions ⋮ Bounds for pairs in partitions of graphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ Balanced judicious bipartitions of graphs ⋮ On judicious bipartitions of graphs ⋮ Max-bisections of \(H\)-free graphs ⋮ Bipartitions of oriented graphs ⋮ Judicious \(k\)-partitions of graphs ⋮ On partitions of \(K_{2, 3}\)-free graphs under degree constraints ⋮ Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ A bound on judicious bipartitions of directed graphs ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Bipartite subgraphs ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming ⋮ Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound ⋮ On bisections of directed graphs
This page was built for publication:
