[a, b]-Factors With Given Edges In Graphs

被引：0
|
作者：
Zhou, Sizhong [1 ]
机构：
[1] Jiangsu Univ Sci & Technol, Sch Math & Phys, Zhenjiang 212003, Jiangsu, Peoples R China
来源：
ARS COMBINATORIA | 2014年 / 114卷
关键词：
graph; subgraph; minimum degree; a; b]-factor; INDEPENDENT SETS; NEIGHBORHOODS;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be a graph, and let a and b be integers with 1 <= a <= b. An [a, b]-factor of G is defined as a spanning subgraph F of G such that a <= d(F)(x) <= b for each x epsilon V(C). In this paper, we obtain a sufficient condition for a graph to have [a, b]-factors including given edges that extends a well-known sufficient condition for the existence of a k-factor.
引用
收藏
页码：267 / 272
页数：6
相关论文
共 50 条
12345