Vertex-disjoint K1 + (K1 ∪ K2) in K1,4-free graphs with minimum degree at least four

被引:0
|
作者
Yun Shu Gao
Qing Song Zou
机构
[1] Ningxia University,School of Mathematics and Computer Science
[2] Xidian University,Department of Mathematics
来源
Acta Mathematica Sinica, English Series | 2014年 / 30卷
关键词
Forbidden graphs; Vertex-disjoint subgraphs; Minimum degree; 05C35; 05C70;
D O I
暂无
中图分类号
学科分类号
摘要
A graph is said to be K1,4-free if it does not contain an induced subgraph isomorphic to K1,4. Let k be an integer with k ≥ 2. We prove that if G is a K1,4-free graph of order at least 11k-10 with minimum degree at least four, then G contains k vertex-disjoint copies of K1 + (K1 ∪ K2).
引用
收藏
页码:661 / 674
页数:13
相关论文
共 17 条
  • [1] Vertex-disjoint K1 + (K1 ∨ K2) in K 1,4-free Graphs with Minimum Degree at Least Four
    Gao, Yun Shu
    Zou, Qing Song
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2014, 30 (04) : 661 - 674
  • [2] Vertex-disjoint K1+(K1 ∪ K2) in K1,4-free Graphs with Minimum Degree at Least Four
    Yun Shu GAO
    Qing Song ZOU
    ActaMathematicaSinica(EnglishSeries), 2014, 30 (04) : 661 - 674
  • [3] Vertex-disjoint copies of K1 + (K1 ∨ K2) in claw-free graphs
    Fujita, Shinya
    DISCRETE MATHEMATICS, 2008, 308 (09) : 1628 - 1633
  • [4] Vertex-disjoint copies of K1,t in K1,r-free graphs
    Jiang, Suyun
    Chiba, Shuya
    Fujita, Shinya
    Yan, Jin
    DISCRETE MATHEMATICS, 2017, 340 (04) : 649 - 654
  • [5] Vertex-disjoint stars in K1,r-free graphs
    Jiang, Suyun
    Li, Hao
    Yan, Jin
    DISCRETE APPLIED MATHEMATICS, 2021, 302 : 189 - 197
  • [6] Vertex -disjoint copies of K1,3 in K1,r-free graphs
    Jiang, Suyun
    Yan, Jin
    DISCRETE MATHEMATICS, 2016, 339 (12) : 3085 - 3088
  • [7] Vertex disjoint copies of K1,4 in claw-free graphs
    Wang, Yun
    Jiang, Suyun
    Yan, Jin
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 393 (393)
  • [8] K1,3-factors in graphs
    Egawa, Yoshimi
    Fujita, Shinya
    Ota, Katsuhiro
    DISCRETE MATHEMATICS, 2008, 308 (24) : 5965 - 5973
  • [9] Fractional (g, f)-factors in K1,r-free graphs
    Wu, Jie
    Zhou, Sizhong
    UTILITAS MATHEMATICA, 2016, 99 : 241 - 249
  • [10] 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