The Edmonds-Gallai decomposition for matchings in locally finite graphs
From MaRDI portal
Publication:1053712
DOI10.1007/BF02579231zbMath0518.05051OpenAlexW1980028164MaRDI QIDQ1053712
Michel Las Vergnas, François Bry
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579231
Related Items
Maximal tight sets and the Edmonds-Gallai decomposition for matchings, Strict matching matroids and matroid algorithms, On the factorization of graphs with exactly one vertex of infinite degree, Atoms of the matching measure, On the number of 1-factors of locally finite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matchings in graphs. II
- 1-Faktoren von Graphen. (1-factors of graphs)
- Graphs and Subgraphs
- Paths, Trees, and Flowers
- Transversals and matroid partition
- On the structure of factorizable graphs
- The Factorization of Linear Graphs
- The Factorization of Locally Finite Graphs
