A note on internally disjoint alternating paths in bipartite graphs

作者：Lou, DJ^*; Saito, A; Teng, LH

来源：Discrete Mathematics, 2005, 290(1): 105-108.

DOI：10.1016/j.disc.2004.10.019

• matching
• alternating path

Let G be a balanced bipartite graph with partite sets X and Y, which has a perfect matching, and let x is an element of X and y is an element of Y. Let k be a positive integer. Then we prove that if G has k internally disjoint alternating paths between x and y with respect to some perfect matching, then G has k internally disjoint alternating paths between x and y with respect to every perfect matching.

• 出版日期2005-1-28
• 单位中山大学