Affiliation:
1. DEPARTMENT OF COMPUTER SCIENCE; EÖTVÖS LORÁND UNIVERSITY; BUDAPEST HUNGARY
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference8 articles.
1. Infinite, highly connected digraphs with no two arc-disjoint spanning trees;Aharoni;J Graph Theory,1989
2. K. Bérczi A. Frank Packing arborescences, Combinatorial Optimization and Discrete Algorithms, RIMS Kokyuroku Bessatsu 23 2010 1 31
3. Edge-disjoint branchings;Edmonds;Comb Algorithms,1973
4. A note on disjoint arborescences;Fujishige;Combinatorica,2010
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献