The following pages link to (Q4090369):
Displaying 50 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- Judicious partitions of weighted hypergraphs (Q295108) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- Bisections of graphs (Q461728) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Bounds for pairs in partitions of graphs (Q982612) (← links)
- Max \(k\)-cut and judicious \(k\)-partitions (Q982619) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Judicious partitions of hypergraphs (Q1356017) (← links)
- Bipartite subgraphs of integer weighted graphs (Q1381843) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- Fixed-parameter tractable algorithm and polynomial kernel for \textsc{Max-Cut Above Spanning Tree} (Q2300620) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- Bipartite subgraphs (Q2563506) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- The Crossing Number of the Cone of a Graph (Q2961536) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- The Crossing Number of the Cone of a Graph (Q4579956) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← links)
- BIPARTITE SUBGRAPHS OF -FREE GRAPHS (Q4975587) (← links)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced judicious bipartitions of graphs (Q5190331) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
- Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
