THE EXISTENCE OF P≥3-FACTOR COVERED GRAPHS

被引：27

作者：

Zhou, Sizhong ^{[1
]}

Wu, Jiancheng ^{[1
]}

Zhang, Tao ^{[2
]}

机构：

[1] Jiangsu Univ Sci & Technol, Sch Math & Phys, Mengxi Rd 2, Zhenjiang 212003, Jiangsu, Peoples R China

[2] Jiangsu Univ Sci & Technol, Sch Econ & Management, Mengxi Rd 2, Zhenjiang 212003, Jiangsu, Peoples R China

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2017年 / 37卷 / 04期

基金：

中国国家自然科学基金;

关键词：

P->= 3-factor; P->= 3-factor covered graph; toughness; isolated toughness; regular graph; LARGE COMPONENTS; SUFFICIENT CONDITION; LEAST; TOUGHNESS; LENGTH; PATHS;

D O I：

10.7151/dmgt.1974

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A spanning subgraph F of a graph G is called a P->= 3-factor of G if every component of F is a path of order at least 3. A graph G is called a P->= 3-factor covered graph if G has a P->= 3-factor including e for any e is an element of E(G). In this paper, we obtain three sufficient conditions for graphs to be P->= 3-factor covered graphs. Furthermore, it is shown that the results are sharp.

引用

页码：1055 / 1065

页数：11

共 19 条

[1]

Akiyama J., 2011, LECT NOTES MATH

[2]

Akiyama J., 1980, TRU MATH, V16, P97

[3] Partitioning vertices of 1-tough graphs into paths [J].