Subject
Discrete Mathematics and Combinatorics
Reference23 articles.
1. Minimum partition of a matroid into independent subsets;Edmonds;J. Res. Nat. Bur. Standards Sect. B,1965
2. Edge-disjoint branchings;Edmonds,1973
3. On the complexity of time-table and multi-commodity flow problems;Even;SIAM J. Comput.,1976
4. S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, to appear.
5. Simplicial decompositions of infinite graphs;Halin;Ann. Discrete Math.,1978
Cited by
143 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linkages and removable paths avoiding vertices;Journal of Combinatorial Theory, Series B;2024-11
2. Killing a Vortex;Journal of the ACM;2024-08
3. A Flat Wall Theorem for Matching Minors in Bipartite Graphs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Local degree conditions for K9 ${K}_{9}$‐minors in graphs;Journal of Graph Theory;2024-05-08
5. A graph minor condition for graphs to be k-linked;European Journal of Combinatorics;2024-02