Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. F. Barahona and M. Conforti: A construction for binary matroids, Discrete Math.
66 (1987), 213–218.
2. M. Conforti and M. R. Rao: Some new matroids on graphs: Cut sets and the max cut problem, Math. Oper. Res.
12 (1987), 193–204.
3. J. Geelen, B. Gerards and G. Whittle: The highly-connected matroids in minorclosed classes, Ann. Comb.
19 (2015), 107–123.
4. C. D. Godsil: Algebraic Combinatorics, Chapman and Hall, New York, 1993.
5. D. R. Karger: Global min-cuts in RNC, and other ramifications of a simple mincut algorithm, in: Proc. 4th Annu. ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1993, 84–93.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Eulerian ideals;Communications in Algebra;2022-08-05
2. Submodular Minimization Under Congruency Constraints;Combinatorica;2019-10-29