Disjoint K1,4 in claw-free graphs with minimum degree at least four∗

被引：0
|
作者：
机构：
[1] Gao, Yunshu
[2] Zhou, Haijuan
来源：
| 1600年 / Charles Babbage Research Centre卷 / 103期
关键词：
921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
6
引用
收藏
相关论文
共 50 条
  • [1] Disjoint K 4 - in claw-free graphs with minimum degree at least five
    Gao, Yunshu
    Zou, Qingsong
    FRONTIERS OF MATHEMATICS IN CHINA, 2015, 10 (01) : 53 - 68
  • [2] Disjoint K4− in claw-free graphs with minimum degree at least five
    Yunshu Gao
    Qingsong Zou
    Frontiers of Mathematics in China, 2015, 10 : 53 - 68
  • [3] Vertex disjoint copies of K1,4 in claw-free graphs
    Wang, Yun
    Jiang, Suyun
    Yan, Jin
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 393 (393)
  • [4] Minimum Degree and Disjoint Cycles in Claw-Free Graphs
    Faudree, Ralph J.
    Gould, Ronald J.
    Jacobson, Michael S.
    COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (1-2): : 129 - 139
  • [5] Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three
    Hong Wang
    Combinatorica, 1998, 18 : 441 - 447
  • [6] Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
    Wang, H
    COMBINATORICA, 1998, 18 (03) : 441 - 447
  • [7] Minimum degree and disjoint cycles in generalized claw-free graphs
    Faudree, Ralph J.
    Gould, Ronald J.
    Jacobson, Michael S.
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (05) : 875 - 883
  • [8] Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four
    Lu, Changhong
    Mao, Rui
    Wang, Bing
    ARS COMBINATORIA, 2018, 139 : 393 - 409
  • [9] Paired-domination in claw-free graphs with minimum degree at least four
    Cao, Xinguo
    Shan, Erfang
    ARS COMBINATORIA, 2016, 127 : 401 - 408
  • [10] Vertex-disjoint K1 + (K1 ∪ K2) in K1,4-free graphs with minimum degree at least four
    Yun Shu Gao
    Qing Song Zou
    Acta Mathematica Sinica, English Series, 2014, 30 : 661 - 674
12345