Pages that link to "Item:Q1381843"
From MaRDI portal
The following pages link to Bipartite subgraphs of integer weighted graphs (Q1381843):
Displaying 23 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- Judicious partitions of uniform hypergraphs (Q484549) (← links)
- Max \(k\)-cut and judicious \(k\)-partitions (Q982619) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Inverting the Turán problem with chromatic number (Q2037594) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Inverting the Turán problem (Q2421851) (← links)
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs (Q2454588) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- Problems and results on judicious partitions (Q4798176) (← 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)
- Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
