The perfectly Matchable Subgraph Polytope of an arbitrary graph
- 1 December 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (4), 321-337
- https://doi.org/10.1007/bf02125345
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- Facets of I-matching polyhedraLecture Notes in Mathematics, 1974
- Perfect matchings of a graphJournal of Combinatorial Theory, Series B, 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
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947