Pages that link to "Item:Q477337"
From MaRDI portal
The following pages link to A bound for judicious \(k\)-partitions of graphs (Q477337):
Displaying 20 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- On judicious partitions of graphs (Q281768) (← links)
- Bounds for pairs in partitions of graphs (Q982612) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Judicious partitions of graphs (Q1314903) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- Exact bounds for judicious partitions of graphs (Q1977429) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
- On Bounds for the k-Partitioning of Graphs (Q4938663) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 (Q5366944) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
