Bipartite subgraphs of integer weighted graphs
From MaRDI portal
Publication:1381843
DOI10.1016/S0012-365X(97)00041-1zbMath0903.05028MaRDI QIDQ1381843
Publication date: 1 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (23)
On judicious partitions of uniform hypergraphs ⋮ Problems and results on judicious partitions ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ Inverting the Turán problem ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Lower Bounds for Maximum Weighted Cut ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ Maximum cuts of graphs with forbidden cycles ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Judicious partitions of uniform hypergraphs ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ On judicious bipartitions of graphs ⋮ Inverting the Turán problem with chromatic number ⋮ Judicious \(k\)-partitions of graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Judicious partitions of bounded‐degree graphs ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Hypergraph cuts above the average ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ On bisections of directed graphs
Cites Work
This page was built for publication: Bipartite subgraphs of integer weighted graphs
