Author:
Gerards A. M. H.,Schrijver A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. M. Boulala andJ. P. Uhry, Polytope des indépendants d’un graphe série-parallèle,Discrete Mathematics 27 (1979), 225–243.
2. V. Chvátal, Edmonds polytopes and a hierarchy of combinatorial problems,Discrete Mathematics 4 (1973), 305–337.
3. V. Chvátal, On certain polytopes associated with graphs,Journal of Combinatorial Theory (B) 18 (1975), 138–154.
4. J. Edmonds, Maximum matching and a polyhedron with 0, 1 vertices,Journal of Research of the National Bureau of Standards (B) 69 (1965), 125–130.
5. J. Edmonds andE. L. Johnson, Matching: a well-solved class of integer linear programs,in: Combinatorial Structures and Their Applications (R. K. Guy, et al., eds.), Gordon and Breach, New York, 1970, 89–92.
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献