TR-2002-04

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

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.