Packing and covering of crossing families of cuts
From MaRDI portal
(Redirected from Publication:789399)
Recommendations
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3661345 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3290885 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- A Minimax Theorem for Directed Graphs
- A counterexample to a conjecture of Edmonds and Giles
- Directed cut transversal packing for source-sink connected graphs
- Min-max Relations for Directed Graphs
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- On two minimax theorems in graph
- Packing rooted directed cuts in a weighted directed graph
- Proving total dual integrality with cross-free families—A general framework
- Some remarks on good colorations
- The matroids with the max-flow min-cut property
Cited in
(4)
This page was built for publication: Packing and covering of crossing families of cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789399)