On judicious bipartitions of directed graphs
From MaRDI portal
Publication:2144584
Recommendations
Cites work
- A bound for judicious \(k\)-partitions of graphs
- A bound on judicious bipartitions of directed graphs
- Balanced judicious bipartitions of graphs
- Better bounds for \(k\)-partitions of graphs
- Bipartite density of triangle-free subcubic graphs
- Bipartite subgraphs
- Bipartitions of oriented graphs
- Bisections of graphs
- Bounds for pairs in judicious partitioning of graphs
- Bounds for pairs in partitions of graphs
- Exact bounds for judicious partitions of graphs
- scientific article; zbMATH DE number 3510345 (Why is no real title available?)
- scientific article; zbMATH DE number 1787231 (Why is no real title available?)
- Judicious partitions and related problems
- Judicious partitions of directed graphs
- Judicious partitions of hypergraphs
- Maximum directed cuts in acyclic digraphs
- On bipartitions of directed graphs with small semidegree
- On bisections of directed graphs
- On judicious bipartitions of graphs
- On judicious bisections of graphs
- On several partitioning problems of Bollobás and Scott
- On tight components and anti-tight components
- Partitioning digraphs with outdegree at least 4
- Problems and results on judicious partitions
- Some Extremal Properties of Bipartite Subgraphs
- Triangle-free subcubic graphs with minimum bipartite density
Cited in
(10)- On bipartitions of directed graphs with small semidegree
- A bound on judicious bipartitions of directed graphs
- On bisections of directed graphs
- Judicious bisection of hypergraphs
- Judicious partitions of directed graphs
- On judicious bisections of graphs
- Partitioning digraphs with outdegree at least 4
- Graph partitioning: an updated survey
- Optimal bisections of directed graphs
- Bisections of directed graphs without complete bipartite subgraphs
This page was built for publication: On judicious bipartitions of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144584)