A Note on Path-Matchings
JZ Yan, Heping Zhang · Lanzhou University Institutional Repository · 2009
A well-known result on matchings of graphs is that the intersection of all maximal barriers is equal to "set A" in the Gallai-Edmonds decomposition. In this paper, we give a generalization of this result to the framework of path-matchings introduced by Cunningham and Geelen. Further we present a sufficient condition for a graph to have a perfect path-matching.