Pages that link to "Item:Q1003836"
From MaRDI portal
The following pages link to Judicious \(k\)-partitions of graphs (Q1003836):
Displaying 17 items.
- 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)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced judicious bipartitions of graphs (Q5190331) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
