On Maximum Edge Cuts of Connected Digraphs

DOI10.1002/jgt.21746zbMath1294.05083OpenAlexW1507946629MaRDI QIDQ5418765

Manzhan Gu, Guantao Chen, Nana Li

Publication date: 28 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21746

zbMATH Keywords

digraphmaximum edge cuts

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

Graph partitioning: an updated survey ⋮ A bound on judicious bipartitions of directed graphs

Cites Work

• Optimization, approximation, and complexity classes
• Maximum directed cuts in graphs with degree constraints
• Triangle-free subcubic graphs with minimum bipartite density
• Maximum directed cuts in acyclic digraphs
• Maximum directed cuts in digraphs with degree restriction
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three

This page was built for publication: On Maximum Edge Cuts of Connected Digraphs