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 条
  • [31] The connected vertex cover problem in k-regular graphs
    Yuchao Li
    Wei Wang
    Zishen Yang
    Journal of Combinatorial Optimization, 2019, 38 : 635 - 645
  • [32] Vertex partitions by connected monochromatic k-regular graphs
    Sárközy, GN
    Selkow, SM
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2000, 78 (01) : 115 - 122
  • [33] Determination of the sizes of optimal (m, n, k, λ, k-1)-OOSPCs for λ = k-1, k
    Pan, Rong
    Chang, Yanxun
    DISCRETE MATHEMATICS, 2013, 313 (12) : 1327 - 1337
  • [34] Contractible edges of k-connected graphs for k=4, 5
    Qin, Chengfu
    Guo, Xiaofeng
    ARS COMBINATORIA, 2010, 97 : 321 - 332
  • [35] k-regular factors and semi-k-regular factors in bipartite graphs
    Keiko Kotani
    Annals of Combinatorics, 1998, 2 (2) : 137 - 144
  • [36] On vertices of degree k of minimal and contraction critical k-connected graphs: upper bounds
    S. A. Obraztsova
    A. V. Pastor
    Journal of Mathematical Sciences, 2012, 184 (5) : 655 - 661
  • [37] Connected [k,k+1]-factors of graphs
    Cai, MC
    DISCRETE MATHEMATICS, 1997, 169 (1-3) : 1 - 16
  • [38] On k-distance Pell numbers and ((k-1)A, (k-1)B, kC)-edge coloured graphs
    Piejko, Krzysztof
    ARS COMBINATORIA, 2018, 139 : 197 - 215
  • [39] ON UNIFORMLY RESOLVABLE {K-1,K-2, K-1,K-3}-DESIGNS
    Lo Faro, Giovanni
    Milici, Salvatore
    Tripodi, Antoinette
    ATTI ACCADEMIA PELORITANA DEI PERICOLANTI-CLASSE DI SCIENZE FISICHE MATEMATICHE E NATURALI, 2018, 96 : A91 - A97
  • [40] On strictly Deza graphs with parameters (n, k, k-1, a)
    Kabanov, V. V.
    Maslova, N. V.
    Shalaginov, L. V.
    EUROPEAN JOURNAL OF COMBINATORICS, 2019, 80 : 194 - 202
12345