Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference15 articles.
1. Two theorems in graph theory;Berge;Proc. Nat. Acad. Sci. U.S.A.,1957
2. Sur le conplage maximum d'un graphe;Berge;C.R. Acad. Sci. Paris,1958
3. Paths, trees and flowers;Edmonds;Canad. J. Math.,1965
4. Matching: a well solved class of integer programs;Edmonds,1970
5. An efficient implementation of Edmonds' algorithm for maximum matching on graphs;Gabow;J. ACM,1976
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On caterpillar factors in graphs;Theoretical Computer Science;2020-12
2. Factors and Factorization;Discrete Mathematics and Its Applications;2013-11-26
3. Oriented star packings;Journal of Combinatorial Theory, Series B;2008-05
4. Graph factors and factorization: 1985–2003: A survey;Discrete Mathematics;2007-04
5. Packing paths in digraphs;Journal of Graph Theory;2003-09-09