Packing and covering of crossing families of cuts

DOI10.1016/0095-8956(83)90066-7zbMath0533.05039OpenAlexW1992939576MaRDI QIDQ789399

Alexander Schrijver

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10050

zbMATH Keywords

coveringmax-flow min-cut propertyminimum lengthcrossing family of subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Generalized polymatroids and submodular flows

Cites Work

• Directed cut transversal packing for source-sink connected graphs
• A counterexample to a conjecture of Edmonds and Giles
• Some remarks on good colorations
• On two minimax theorems in graph
• The matroids with the max-flow min-cut property
• Proving total dual integrality with cross-free families—A general framework
• Min-max Relations for Directed Graphs
• A Minimax Theorem for Directed Graphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Packing rooted directed cuts in a weighted directed graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing and covering of crossing families of cuts