Packing non-returning A-paths (Q2460627)

Recently, \textit{M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman} and \textit{P. Seymour} [Combinatorica 26, No. 5, 521--532 (2006; Zbl 1127.05050)] gave a min-max formula for the maximum number of node-disjoint non-zero \(A\)-paths in group-labeled graphs, which generalize a result of \textit{W. Mader} [Arch. Math. 30, 325--336 (1978; Zbl 0354.05042)] on node-disjoint \(A\)-paths. Using an analogue of Berge's alternating paths' lemma, the author presents a further generalization with a shorter proof. The method is related to a short proof of Mader's theorem given by \textit{A. Schrijver}[J. Comb. Theory, Ser. B 82, No. 2, 319--321 (2001; Zbl 1027.05051)].