On the cycle polytope of a binary matroid
- 1 February 1986
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 40 (1) , 40-62
- https://doi.org/10.1016/0095-8956(86)90063-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The max-cut problem on graphs not contractible to K5Operations Research Letters, 1983
- Matroids and Multicommodity FlowsEuropean Journal of Combinatorics, 1981
- Adjacency on the Postman PolyhedronSIAM Journal on Algebraic Discrete Methods, 1981
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965