A Gallai–Edmonds‐type structure theorem for path‐matchings
From MaRDI portal
Publication:4474277
DOI10.1002/jgt.10175zbMath1041.05063OpenAlexW3216138242MaRDI QIDQ4474277
Publication date: 4 August 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10175
Related Items (4)
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ On the maximum even factor in weakly symmetric graphs ⋮ A weighted independent even factor algorithm ⋮ A weighted even factor algorithm
Cites Work
This page was built for publication: A Gallai–Edmonds‐type structure theorem for path‐matchings
