Covering directed and odd cuts
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 99-112
- https://doi.org/10.1007/bfb0121011
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- How to make a digraph strongly connectedCombinatorica, 1981
- On Odd Cuts and Plane Multicommodity FlowsProceedings of the London Mathematical Society, 1981
- ber die Maximalzahl kantendisjunkterA- WegeArchiv der Mathematik, 1978
- A Minimax Theorem for Directed GraphsJournal of the London Mathematical Society, 1978
- MATROIDS AND SUBMODULAR FUNCTIONSThe Quarterly Journal of Mathematics, 1976
- 2-Matchings and 2-covers of hypergraphsActa Mathematica Hungarica, 1975
- A Theorem on Graphs, with an Application to a Problem of Traffic ControlThe American Mathematical Monthly, 1939