On some properties of critically h-connected graphs and k-critically h-connected graphs

被引:0
|
作者
机构
来源
| 1600年 / Publ by New York Acad of Sciences, New York, NY, USA卷 / 576期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] The Average Degree of Minimally Contraction-Critically 5-Connected Graphs
    Ando, Kiyoshi
    Egawa, Yoshimi
    Kriesell, Matthias
    JOURNAL OF GRAPH THEORY, 2014, 75 (04) : 331 - 354
  • [42] Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs
    On-Hei Solomon Lo
    Jens M. Schmidt
    Graphs and Combinatorics, 2021, 37 : 2129 - 2137
  • [43] Connected greedy coloring of H-free graphs
    Mota, Esdras
    Rocha, Leonardo
    Silva, Ana
    DISCRETE APPLIED MATHEMATICS, 2020, 284 (284) : 572 - 584
  • [44] On Characterization of Graphs Structures Connected with Some Algebraic Properties
    Huang, Rongbing
    Nadeem, Muhammad
    Rashid, Iqra
    Siddiqui, M. K.
    Fufa, Samuel Asefa
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2022, 2022
  • [45] On Characterization of Graphs Structures Connected with Some Algebraic Properties
    Huang, Rongbing
    Nadeem, Muhammad
    Rashid, Iqra
    Siddiqui, M. K.
    Fufa, Samuel Asefa
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2022, 2022
  • [46] Graphs G for which both G and (G)over-bar are contraction critically k-connected
    Akiyama, J
    Ando, K
    Egawa, Y
    GRAPHS AND COMBINATORICS, 2002, 18 (04) : 693 - 708
  • [47] Some special minimum k-geodetically connected graphs
    Lan, Yingjie
    Chen, Songqing
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (10) : 1002 - 1012
  • [48] Some sufficient conditions for graphs to be k-leaf-connected
    Liu, Hechao
    You, Lihua
    Hua, Hongbo
    Du, Zenan
    DISCRETE APPLIED MATHEMATICS, 2024, 352 : 1 - 8
  • [49] Connected k-dominating graphs
    Mynhardt, C. M.
    Teshima, L. E.
    Roux, A.
    DISCRETE MATHEMATICS, 2019, 342 (01) : 145 - 151
  • [50] On k-chromatically connected graphs
    Dudek, Andrzej
    Nistase, Esmeralda
    Roedl, Vojtech
    DISCRETE MATHEMATICS, 2009, 309 (18) : 5547 - 5550