Pages that link to "Item:Q4474279"
From MaRDI portal
The following pages link to Judicious partitions of bounded‐degree graphs (Q4474279):
Displaying 20 items.
- 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 note on balanced bipartitions (Q709305) (← links)
- Bounds for judicious balanced bipartitions of graphs (Q1756085) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- On a problem of Ahlswede and Katona (Q2995575) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Maximum number of colorings of (2<i>k, k</i><sup>2</sup>)‐graphs (Q5434250) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
- A note on judicious bisections of graphs (Q6666591) (← links)
