The following pages link to Bisections of graphs (Q461728):
Displaying 22 items.
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- On judicious partitions of graphs (Q281768) (← links)
- Judicious bisection of hypergraphs (Q287970) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- On tight components and anti-tight components (Q897283) (← links)
- On splitting digraphs (Q1750217) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← links)
- On minimum balanced bipartitions of triangle-free graphs (Q2015796) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Bipartition of graph under degree constraints (Q2515316) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- Judicious partitions of directed graphs (Q3467583) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
