Pages that link to "Item:Q5668830"
From MaRDI portal
The following pages link to Some Extremal Properties of Bipartite Subgraphs (Q5668830):
Displaying 50 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- On judicious partitions of graphs (Q281768) (← 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)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- The bipartite edge frustration of composite graphs (Q608263) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- On bipartite restrictions of binary matroids (Q648977) (← links)
- The bipartite edge frustration of graphs under subdivided edges and their related sums (Q651481) (← links)
- Extremal properties of the bipartite vertex frustration of graphs (Q654182) (← links)
- On existence theorems (Q686508) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Partitioning posets (Q943378) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Bounds for pairs in partitions of graphs (Q982612) (← links)
- Max \(k\)-cut and judicious \(k\)-partitions (Q982619) (← links)
- The bipartite edge frustration of extension of splice and link graphs (Q988725) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← 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 graphs (Q1314903) (← links)
- Judicious partitions of hypergraphs (Q1356017) (← links)
- The size of the largest bipartite subgraphs (Q1377883) (← links)
- Bipartite subgraphs of integer weighted graphs (Q1381843) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- Judicious partitions of 3-uniform hypergraphs (Q1972352) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← 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)
- Hypergraph cuts above the average (Q2327966) (← links)
