Disjoint K 4 - in claw-free graphs with minimum degree at least five

被引：1

作者：

Gao, Yunshu ^{[1
]}

Zou, Qingsong ^{[2
]}

机构：

[1] Ningxia Univ, Sch Math & Comp Sci, Yinchuan 750021, Peoples R China

[2] Xidian Univ, Dept Math, Xian 710071, Peoples R China

来源：

FRONTIERS OF MATHEMATICS IN CHINA | 2015年 / 10卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Forbidden graph; vertex-disjoint subgraph; minimum degree;

D O I：

10.1007/s11464-014-0434-y

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K (1,3). Let K (4) (-) be the graph obtained by removing exactly one edge from K (4) and let k be an integer with k a (c) 3/4 2. We prove that if G is a claw-free graph of order at least 13k - 12 and with minimum degree at least five, then G contains k vertex-disjoint copies of K (4) (-) . The requirement of number five is necessary.

引用

页码：53 / 68

页数：16

共 7 条

[1]

Bondy J.A., 2008, GTM

[2]

Fujita S., 2006, HIROSHIMA MATH J, V36, P397

[3] Vertex-disjoint copies of K1 + (K1 ∨ K2) in claw-free graphs [J].

Fujita, Shinya .

DISCRETE MATHEMATICS, 2008, 308 (09) :1628-1633

[4]

Kawarabayashi K, 2002, ARS COMBINATORIA, V62, P183

[5] K-4-factor in a graph [J].

Kawarabayashi, K .

JOURNAL OF GRAPH THEORY, 2002, 39 (02) :111-128

[6] Vertex-disjoint triangles in claw-free graphs with minimum degree at least three [J].

Wang, H .

COMBINATORICA, 1998, 18 (03) :441-447

[7] Vertex-disjoint triangles in K1,t-free graphs with minimum degree at least t [J].

Zhang, Xin ;

Li, Na ;

Wu, Jian-Liang ;

Yan, Jin .

DISCRETE MATHEMATICS, 2010, 310 (19) :2499-2503

← 1 →