Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Balas, E., Pulleyblank, W.: The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica 9, 321–337 (1989)
2. Cunningham, W.H.: Matching, matroids, and extensions. Mathematical Programming 91(3), 515–542 (2002)
3. Cunningham, W.H., Geelen, J.F.: The optimal path-matching problem. Combinatorica 17, 315–337 (1997)
4. Cunningham, W.H., Geelen, J.F.: Combinatorial algorithms for path-matching (2000) (manuscript)
5. Cunningham, W.H., Geelen, J.F.: Vertex-disjoint dipaths and even dicircuits (2001) (manuscript)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献