On bipartitions of directed graphs with small semidegree

DOI10.1016/j.ejc.2019.103039zbMath1428.05248OpenAlexW2981585407MaRDI QIDQ2011152

Zhe Li, Shu-Fei Wu, Jian-Feng Hou

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

zbMATH Keywords

partitionoriented graphtight componentminimum semidegree

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On judicious bipartitions of directed graphs ⋮ Odd induced subgraphs in planar graphs with large girth ⋮ Partitioning digraphs with outdegree at least 4 ⋮ Graph partitioning: an updated survey ⋮ Optimal bisections of directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On judicious bisections of graphs
• Bisections of graphs
• On several partitioning problems of Bollobás and Scott
• Bipartitions of oriented graphs
• On tight components and anti-tight components
• The size of the largest bipartite subgraphs
• 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
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Some Extremal Properties of Bipartite Subgraphs
• On judicious bipartitions of graphs

This page was built for publication: On bipartitions of directed graphs with small semidegree