A Gallai–Edmonds-type structure theorem for path-matchings

Authors:
Bianca Spille;László Szegő
Affiliations:
Institute for Mathematical Optimization, University of Magdeburg, Universitätsplatz 2, D-39106 Magdeburg, Germany;Department of Operations Research, Eötvös University, Pázmány Péter Sétány 1-C, Budapest, Hungary H-1117
Venue:
Journal of Graph Theory
Year:
2004

Citing 0
Cited 3

On the maximum even factor in weakly symmetric graphs

Journal of Combinatorial Theory Series B
The independent even factor problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial algorithm to find a maximum even factor

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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