Edmonds polytopes and a hierarchy of combinatorial problems
Top Cited Papers
- 28 March 2002
- journal article
- Published by Elsevier
- Vol. 4 (4) , 305-337
- https://doi.org/10.1016/0012-365x(73)90167-2
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Remarks on a Problem of MoserCanadian Mathematical Bulletin, 1972
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Hypergraphs and Ramseyian TheoremsProceedings of the American Mathematical Society, 1971
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947