Bipartitions of oriented graphs
From MaRDI portal
Publication:723882
DOI10.1016/j.jctb.2018.03.003zbMath1391.05208OpenAlexW2792270702MaRDI QIDQ723882
Publication date: 24 July 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2018.03.003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (8)
Maximum bisections of graphs without cycles of length 4 ⋮ On judicious bipartitions of directed graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ Graph partitioning: an updated survey ⋮ Optimal bisections of directed graphs ⋮ On bipartitions of directed graphs with small semidegree ⋮ On partitions of \(K_{2, 3}\)-free graphs under degree constraints ⋮ A bound on judicious bipartitions of directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On judicious partitions of uniform hypergraphs
- On judicious bisections of graphs
- Bisections of graphs
- On several partitioning problems of Bollobás and Scott
- Partitioning 3-uniform hypergraphs
- Bounds for pairs in partitions of graphs
- Judicious partitions of hypergraphs
- Exact bounds for judicious partitions of graphs
- On bisections of directed graphs
- Weighted sums of certain dependent random variables
- Bounds for pairs in judicious partitioning of graphs
- Judicious partitions of directed graphs
- Bisections of Graphs Without Short Cycles
- Problems and results on judicious partitions
- Balanced judicious bipartitions of graphs
- Better Bounds for k-Partitions of Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
- Some Extremal Properties of Bipartite Subgraphs
- On judicious bipartitions of graphs
This page was built for publication: Bipartitions of oriented graphs
