Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. On an obstruction for perfect matchings;Aharoni;Combinatorica,1984
2. Matchings in graphs of size N1;Aharoni;J. Combin. Theory Ser. B,1984
3. A generalization of Tutte's 1-factor theorem to countable graphs;Aharoni;J. Combin. Theory Ser. B,1984
4. König's duality theorem for infinite bipartite graphs;Aharoni;J. London Math. Soc.,1984
5. A general criterion for the existence of transversals;Aharoni,1983
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Lovász-Cherkassky theorem in countable graphs;Journal of Combinatorial Theory, Series B;2023-03
2. The computational strength of matchings in countable graphs;Annals of Pure and Applied Logic;2022-08
3. Factors and Factorization;Discrete Mathematics and Its Applications;2013-11-26
4. Menger’s theorem for infinite graphs;Inventiones mathematicae;2008-12-05
5. Graph factors and factorization: 1985–2003: A survey;Discrete Mathematics;2007-04