On bisections of directed graphs

DOI10.1016/J.EJC.2017.02.004MaRDI QIDQ2357220zbMATH OpenOpenAlexFDO

Authors Jianfeng Hou, Shu-Fei Wu, Guiying Yan

Publication date 19 June 2017

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2017.02.004

zbMATH Keywords

combinatorial optimization problem

Mathematics Subject Classification ID

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

Recommendations

• On bipartitions of directed graphs with small semidegree
• Bipartitions of oriented graphs
• On judicious bipartitions of directed graphs
• Judicious partitions of directed graphs
• Bisections of graphs

Cites work

• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1787231 (Why is no real title available?)
• A note on balanced bipartitions
• Balanced judicious bipartitions of graphs
• Bipartite density of triangle-free subcubic graphs
• Bipartite subgraphs
• Bipartite subgraphs of integer weighted graphs
• Bisections of graphs
• Cycles of even length in graphs
• Judicious partitions and related problems
• Judicious partitions of bounded‐degree graphs
• Maximum directed cuts in acyclic digraphs
• On judicious bisections of graphs
• On tight components and anti-tight components
• Probability Inequalities for Sums of Bounded Random Variables
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs
• Triangle-free subcubic graphs with minimum bipartite density
• Weighted sums of certain dependent random variables

Cited in

(12)

• Maximum bisections of graphs without cycles of length 4
• Optimal bisections of directed graphs
• A bound on judicious bipartitions of directed graphs
• Maximum bisections of graphs without cycles of length four and five
• Graph bisection revisited
• On splitting digraphs
• Bipartitions of oriented graphs
• Maximum bisections of graphs with girth at least six
• Partitioning digraphs with outdegree at least 4
• Graph partitioning: an updated survey
• On bipartitions of directed graphs with small semidegree
• On judicious bipartitions of directed graphs

This page was built for publication: On bisections of directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357220)