On bipartitions of directed graphs with small semidegree
From MaRDI portal
Publication:2011152
DOI10.1016/J.EJC.2019.103039zbMATH Open1428.05248OpenAlexW2981585407MaRDI QIDQ2011152FDOQ2011152
Authors: Zhe Li, Jianfeng Hou, Shu-Fei Wu 
Publication date: 28 November 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2019.103039
Recommendations
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- Title not available (Why is that?)
- Exact bounds for judicious partitions of graphs
- Weighted sums of certain dependent random variables
- Judicious partitions and related problems
- On judicious bisections of graphs
- Title not available (Why is that?)
- Bisections of graphs
- Problems and results on judicious partitions
- Some Extremal Properties of Bipartite Subgraphs
- On several partitioning problems of Bollobás and Scott
- Better bounds for \(k\)-partitions of graphs
- On judicious bipartitions of graphs
- The size of the largest bipartite subgraphs
- Title not available (Why is that?)
- On bisections of directed graphs
- Bounds for pairs in judicious partitioning of graphs
- Judicious partitions of directed graphs
- Bipartitions of oriented graphs
- On tight components and anti-tight components
Cited In (7)
This page was built for publication: On bipartitions of directed graphs with small semidegree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011152)
