Pages that link to "Item:Q1400968"
From MaRDI portal
The following pages link to Maximum cuts and judicious partitions in graphs without short cycles (Q1400968):
Displaying 45 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Bisections of graphs (Q461728) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- Partitioning 3-uniform hypergraphs (Q765201) (← 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)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- On judicious partitions of hypergraphs with edges of size at most 3 (Q2349971) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- Judicious partitions of directed graphs (Q3467583) (← 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)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← 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 Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 (Q5366944) (← links)
- Maximum bipartite subgraphs in $H$-free graphs (Q5867125) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
- Bounds on maximum weight directed cut (Q6606913) (← links)
- 10 problems for partitions of triangle-free graphs (Q6612517) (← links)
- Maximum bisections of graphs with girth at least six (Q6640955) (← links)
- Orthonormal representations, vector chromatic number, and extension complexity (Q6644170) (← links)
- Maximum bisections of graphs without cycles of length four and five (Q6648263) (← links)
