Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. R. Aharoni and E. Berger: Menger's theorem for infinite graphs, Invent. Math.176 (2009), 1–62.
2. R. Diestel: Graph theory, Graduate Texts in Mathematics 173, 5, Springer, Berlin, 2017.
3. G. Calvillo-Vives: Optimum branching systems, 1978, (Ph.D. Thesis), University of Waterloo.
4. L. Lovász: Connectivity in digraphs, J. Combinatorial Theory Ser. B15 (1973), 174–177.
5. J. S. Pym: The linking of sets in graphs, J. London Math. Soc.44 (1969), 542–550.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Large vertex-flames in uncountable digraphs;Israel Journal of Mathematics;2023-06-03
2. Enlarging vertex-flames in countable digraphs;Journal of Combinatorial Theory, Series B;2021-11
3. Greedoids from flames;Journal of Graph Theory;2021-05-21