Directed cut transversal packing for source-sink connected graphs

DOI10.1007/BF02579302zbMath0642.05027MaRDI QIDQ1101126

B. George

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

directed graphmaximum packing of directed cut transversalsminimum directed cut

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Disjoint dijoins for classes of dicuts in finite and infinite digraphs ⋮ Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Intersection properties of maximal directed cuts in digraphs ⋮ Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ Note on a min-max conjecture of Woodall ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings ⋮ Complexity of packing common bases in matroids ⋮ Packing and covering of crossing families of cuts ⋮ A family of perfect graphs associated with directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two minimax theorems in graph
• The matroids with the max-flow min-cut property
• Min-max Relations for Directed Graphs
• A Minimax Theorem for Directed Graphs

This page was built for publication: Directed cut transversal packing for source-sink connected graphs