K K,K IS (K-1, 1)-CRITICAL FOR K-REGULAR K-CONNECTED GRAPHS

被引：0
|
作者：
ALDRED, REL
JIA, RZ
机构：
[1] UNIV OTAGO,DEPT MATH & STAT,DUNEDIN,NEW ZEALAND
[2] INNER MONGOLIA UNIV,DEPT MATH,HUHEHOT,PEOPLES R CHINA
来源：
ARS COMBINATORIA | 1988年 / 26B卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：247 / 248
页数：2
相关论文
共 50 条
  • [21] Connected [k, k + 1]-factors of graphs 1
    Institute of Systems Science, Academia Sinica, Beijing 100080, China
    [J]. Discrete Math, 1-3 (1-16):
  • [22] Orthogonal [k-1,k+1]-factorizations in graphs
    Liu, GZ
    Yan, GY
    [J]. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1996, 51 (02) : 195 - 200
  • [23] Deza graphs with parameters (n, k, k-1, a) and β=1
    Goryainov, Sergey
    Haemers, Willem H.
    Kabanov, Vladislav V.
    Shalaginov, Leonid
    [J]. JOURNAL OF COMBINATORIAL DESIGNS, 2019, 27 (03) : 188 - 202
  • [24] k-Regular graphs with the circular chromatic index close to k
    Candrakova, Barbora
    Macajova, Edita
    [J]. DISCRETE MATHEMATICS, 2014, 322 : 19 - 25
  • [25] On defining numbers of k-chromatic k-regular graphs
    Soltankhah, N
    Mahmoodian, ES
    [J]. ARS COMBINATORIA, 2005, 76 : 257 - 276
  • [26] Removable edges in a k-connected graph and a construction method for k-connected graphs
    Su, Jianji
    Guo, Xiaofeng
    Xu, Liqiong
    [J]. DISCRETE MATHEMATICS, 2009, 309 (10) : 3161 - 3165
  • [27] Blocks in k-connected graphs
    Karpov D.V.
    [J]. Journal of Mathematical Sciences, 2005, 126 (3) : 1167 - 1181
  • [28] Cliques in k-connected graphs
    Obraztsova S.A.
    [J]. Journal of Mathematical Sciences, 2007, 145 (3) : 4975 - 4980
  • [29] The connected vertex cover problem in k-regular graphs
    Li, Yuchao
    Wang, Wei
    Yang, Zishen
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (02) : 635 - 645
  • [30] Determination of the sizes of optimal (m, n, k, λ, k-1)-OOSPCs for λ = k-1, k
    Pan, Rong
    Chang, Yanxun
    [J]. DISCRETE MATHEMATICS, 2013, 313 (12) : 1327 - 1337
12345