A well-known result on matchings of graphs is that the intersection of all maximal barriers is equal to the “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. Furthermore, we present a sufficient condition for a graph to have a perfect path-matching.