Characterizing minimally n-extendable bipartite graphs

详细信息	查看全文 | 推荐本文 |

• 作者：Dingjun Lou
• 关键词：none ; color ; black" href="/science?_ob=MathURL&_method=retrieve&_udi=B6V00-4NNYJC9-7&_mathId=mml17&_user=1067359&_cdi=5632&_rdoc=21&_acct=C000058823&_version=1&_userid=2795313&md5=5ca01e718429d8151bff2e5e8da516
• 刊名：Discrete Mathematics
• 出版年：2008
• 期刊代码：47_0012365x
• 类别：cp
• 出版时间：6 June 2008
• 卷：308
• 期：11
• 页码：2269-2272
• 文件大小：125 K

摘要

In this paper, it is proved that let G be a bipartite graph with bipartition (X,Y) and with a perfect matching M, let G be an n-extendable graph, then G is minimally n-extendable if and only if, for any two vertices xX and yY such that xyE(G), there are exactly n internally disjoint -alternating paths P₁,P₂,…,P_n such that starts and ends with edges in E(G)M.