Publisher
Springer International Publishing
Reference10 articles.
1. L. Lovász, On two minimax theorems in graph. J. Combin. Theory (B) 21, 96–103 (1976)
2. J. Edmonds, Edge-disjoint branchings, Combinatorial Algorithms (Courant Comput. Sci. Sympos., Vol. 9, New York Univ., New York, 1972), pp. 91–96 (Algorithmics, New York, 1973)
3. C. Lucchesi and D.H. Younger, A minimax theorem for directed graphs, to appear
4. I.P. McWhirter, D.H. Younger, Strong covering of a bipartite graph. J. Lond. Math. Soc. 2, 86–90 (1971)
5. L. Lovász, Minimax theorems for hypergraphs. in Hypergraph Seminar (Lecture Notes in Math, 411) (Springer, New York, 1974), pp. 111–126