Brick decompositions and the matching rank of graphs
- 1 September 1982
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 2 (3) , 247-274
- https://doi.org/10.1007/bf02579233
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Rank of maximum matchings in a graphMathematical Programming, 1982
- Matchings in regular graphsDiscrete Mathematics, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- Facets of I-matching polyhedraLecture Notes in Mathematics, 1974
- On the structure of factorizable graphsActa Mathematica Hungarica, 1972
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- 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