A Gallai–Edmonds‐type structure theorem for path‐matchings
Bianca Spille, László Szegő · Journal of Graph Theory · 2004
Abstract As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 93–102, 2004