Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. R. Aharoni, On an obstruction for perfect matchings,Combinatorica,4 (1984), 1–6.
2. R. Aharoni, A generalization of Tutte’s 1-factor theorem to countable graphs,J. Comb. Th. (B) 37 (1984), 199–209.
3. F. Bry andM. Las Vergnas, The Edmonds—Gallai decomposition for matchings in locally finite graphs,Combinatorica,2 (1982), 229–235.
4. J. Edmonds, Paths, trees and flowers,Can. J. Math.,17 (1965), 449–467.
5. T. Gallai, Maximale Systeme unabhängiger Kanten,Mat. Kut. Int. Közl.,9 (1964), 373–395.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献