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

共 7 条

[1]

Fujita S(2006)Disjoint stars and forbidden subgraphs Hiroshima Math. J. 36 397-403

[2]

Fujita S(2008)Vertex-disjoint copies of Discrete Math. 308 1628-1633

[3]

Kawarabayashi K(2002) + ( Ars Combin. 62 183-187

[4]

Wang H(1998) ∪ Combinatorica 18 441-447

[5]

Zhang X(2010)) in claw-free graphs Discrete Math. 310 2499-2503

[6]

Li N(undefined)-factor and vertex-disjoint undefined undefined undefined-undefined

[7]

Wu J L(undefined) in a graph undefined undefined undefined-undefined

← 1 →