ON DETERMINATION AND CONSTRUCTION OF CRITICALLY 2-CONNECTED GRAPHS

被引:0
|
作者
Borse, Y. M. [1 ]
Waphare, B. N. [1 ]
机构
[1] Univ Pune, Dept Math, Pune, Maharashtra, India
关键词
almost critical; critically; 2-connected; series-parallel graphs; removable ear; G-series;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Kriesell proved that every almost critical graph of connectivity 2 nonisomorphic to a cycle has at least 2 removable ears of length greater than 2. We improve this lower bound on the number of removable ears. A necessary condition for critically 2-connected graphs in terms of a forbidden minor is obtained. Further, we investigate properties of a special class of critically 2-connected series-parallel graphs.
引用
收藏
页码:73 / 83
页数:11
相关论文
共 50 条
  • [1] 2-connected graphs with small 2-connected dominating sets
    Caro, Y
    Yuster, R
    [J]. DISCRETE MATHEMATICS, 2003, 269 (1-3) : 265 - 271
  • [2] Pruning 2-Connected Graphs
    Chandra Chekuri
    Nitish Korula
    [J]. Algorithmica, 2012, 62 : 436 - 463
  • [3] MINIMALLY 2-CONNECTED GRAPHS
    DIRAC, GA
    [J]. JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1967, 228 : 204 - &
  • [4] Inductive construction of 2-connected graphs for calculating the virial coefficients
    Androulaki, E.
    Lambropoulou, S.
    Economou, I. G.
    Przytycki, J. H.
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2010, 43 (31)
  • [5] Cycles in 2-connected graphs
    Fan, GH
    Lv, XZ
    Wang, P
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 92 (02) : 379 - 394
  • [6] Pruning 2-Connected Graphs
    Chekuri, Chandra
    Korula, Nitish
    [J]. ALGORITHMICA, 2012, 62 (1-2) : 436 - 463
  • [7] The connectivities of trunk graphs of 2-connected graphs
    Yoshimoto, K
    [J]. ARS COMBINATORIA, 2001, 60 : 225 - 237
  • [8] The connectivities of leaf graphs of 2-connected graphs
    Kaneko, A
    Yoshimoto, K
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 76 (02) : 155 - 169
  • [9] Reconstruction of 2-connected parity graphs
    Priya, P. Devi
    Monikandan, S.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2021, 80 : 167 - 177
  • [10] Precoloring extension for 2-connected graphs
    Voigt, Margit
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) : 258 - 263