Matching structure and the matching lattice
Author:
- László LovászLLLászló Lovász
- 1 October 1987
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 43 (2) , 187-222
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Rank of maximum matchings in a graphMathematical Programming, 1982
- Brick decompositions and the matching rank of graphsCombinatorica, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Convex polyhedra of doubly stochastic matrices. I. Applications of the permanent functionJournal of Combinatorial Theory, Series A, 1977
- Convex polyhedra of doubly stochastic matrices—IVLinear Algebra and its Applications, 1976
- On the structure of factorizable graphsActa Mathematica Hungarica, 1972
- 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