The perfectly matchable subgraph polytope of a bipartite graph
- 1 December 1983
- Vol. 13 (4), 495-516
- https://doi.org/10.1002/net.3230130405
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On total dual integralityLinear Algebra and its Applications, 1981
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- On lattice polyhedra III: Blockers and anti-blockers of lattice cluttersPublished by Springer Nature ,1978
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- A generalization of max flow—min cutMathematical Programming, 1974
- Matroids and the greedy algorithmMathematical Programming, 1971
- Transversals and matroid partitionJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935