Characterizing minimally n-extendable bipartite graphs

被引：0
|
作者：
Lou, Dingjun [1 ]
机构：
[1] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Peoples R China
来源：
DISCRETE MATHEMATICS | 2008年 / 308卷 / 11期
关键词：
n-extendable graph; minimally n-extendable graph; M-alternating path; bipartite graph;
D O I：
10.1016/j.disc.2007.04.056
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 x epsilon X and y epsilon Y such that xy epsilon E(G), there are exactly n internally disjoint (x, y) M-alternating paths P-1, P-2,..., P-n such that P-i (1 <= i <= n) starts and ends with edges in E(G)\M. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：2269 / 2272
页数：4
相关论文
共 50 条
  • [11] Minimum degree of minimal defect n-extendable bipartite graphs
    Wen, Xuelian
    Yang, Zihui
    DISCRETE MATHEMATICS, 2009, 309 (21) : 6255 - 6264
  • [12] Characterizing 2k-critical graphs and n-extendable graphs
    Aldred, REL
    Holton, DA
    Lou, DJ
    Zhong, N
    DISCRETE MATHEMATICS, 2004, 287 (1-3) : 135 - 139
  • [13] Characterizing defect n-extendable graphs and (2n+1)-critical graphs
    Wen, Xuelian
    Lou, Dingjun
    DISCRETE MATHEMATICS, 2008, 308 (22) : 5064 - 5069
  • [14] Hamiltonian cycles in n-extendable graphs
    Kawarabayashi, K
    Ota, K
    Saito, A
    JOURNAL OF GRAPH THEORY, 2002, 40 (02) : 75 - 82
  • [15] Independence number in n-extendable graphs
    Maschlanka, P
    Volkmann, L
    DISCRETE MATHEMATICS, 1996, 154 (1-3) : 167 - 178
  • [16] Independence number in n-extendable graphs
    Discrete Math, 1-3 (167):
  • [17] Counting perfect matchings in n-extendable graphs
    Doslic, Tomislav
    DISCRETE MATHEMATICS, 2008, 308 (11) : 2297 - 2300
  • [18] A local independence number condition for n-extendable graphs
    Lou, DJ
    DISCRETE MATHEMATICS, 1999, 195 (1-3) : 263 - 268
  • [19] M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities
    Wen, Xuelian
    Zhang, Zan-Bo
    Lou, Dingjun
    DISCRETE MATHEMATICS, 2011, 311 (10-11) : 817 - 826
  • [20] Bipartite matching extendable graphs
    Wang, Xiumei
    Zhang, Zhenkun
    Lin, Yixun
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5334 - 5341
12345