Pages that link to "Item:Q4798176"
From MaRDI portal
The following pages link to Problems and results on judicious partitions (Q4798176):
Displaying 50 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- On judicious partitions of graphs (Q281768) (← links)
- Judicious bisection of hypergraphs (Q287970) (← 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)
- Judicious partitions of uniform hypergraphs (Q484549) (← 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)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- Partitioning 3-uniform hypergraphs (Q765201) (← links)
- On tight components and anti-tight components (Q897283) (← 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)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- On splitting digraphs (Q1750217) (← links)
- Bounds for judicious balanced bipartitions of graphs (Q1756085) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← links)
- On minimum balanced bipartitions of triangle-free graphs (Q2015796) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← 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)
- Minimum balanced bipartitions of planar triangulations (Q2279262) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- On problems about judicious bipartitions of graphs (Q2338639) (← links)
- On judicious partitions of hypergraphs with edges of size at most 3 (Q2349971) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs (Q2454588) (← links)
- Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Internal Partitions of Regular Graphs (Q2825476) (← links)
- Minimum degree thresholds for bipartite graph tiling (Q2888882) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- Graphic Sequences Have Realizations Containing Bisections of Large Degree (Q4650188) (← links)
- On balanced bipartitions of graphs (Q4956227) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
