Author:
Cordovil R.,Moreira M. L.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. M. Conforti, andM. Laurent: On the facial structure of independence system polyhedra,Math. of Operations Research 13 (1988), 543?555.
2. J. Edmonds: Matroids and the greedy algorithm,Math. Programming 1 (1971), 127?136.
3. J. Edmonds: Submodular functions, matroids and certain polyhedra, In: Proc. Int. Conf. Combinatorics (Calgary), Gordon and Breach New York (1970), 69?87.
4. M. Farber: Basic pair graphs of transversal matroids,Discrete Math. 73 (1989), 245?248.
5. M. Farber, B. Richter, andH. Shank: Edge-disjoint spanning trees: A connectedness theorem,J. of Graph Theory 8 (1985), 319?324.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reconfiguration of Basis Pairs in Regular Matroids;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Weighted exchange distance of basis pairs;Discrete Applied Mathematics;2024-05
3. Partitioning into common independent sets via relaxing strongly base orderability;Journal of Combinatorial Theory, Series A;2024-02
4. Exchange Distance of Basis Pairs in Split Matroids;SIAM Journal on Discrete Mathematics;2024-01-08
5. Cyclic base ordering of generalized Petersen graphs;Discrete Mathematics, Algorithms and Applications;2023-04-07