Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Chudnovsky, M., Geelen, J., Gerards, B., Goddyn, L., Lohman, M., Seymour, P.: Packing non-zero A-paths in group-labelled graphs. Combinatorica 26(5), 521–532 (2006)
2. Lovász, L.: Matroid matching and some applications. J. Combinatorial Theory, Ser. B 28, 208–236 (1980)
3. Mader, W.: Uber die maximalzahl kantendisjunkter H-wege. Archiv der Mathematik (Basel) 31, 382–402 (1978)
4. Pap, G.: Packing non-returning A-paths algorithmically. In: EuroComb 2005. European Conference on Combinatorics, Graph Theory and Applications, volume AE of DMTCS Proceedings, Discrete Mathematics and Theoretical Computer Science, pp. 139–144 (2005)
5. Schrijver, A.: A short proof of Mader’s S-paths theorem. Journal of Combinatorial Theory, Ser. B 82, 319–321 (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献